pgr_bridges  pgRouting Manual (3.0)
pgr_bridges
pgr_bridges
 Return the bridges of an undirected graph.
Availability

Version 3.0.0

Return columns change:
seq
is removed 
Official function


Version 2.5.0

New experimental function

Support
Description
A bridge is an edge of an undirected graph whose deletion increases its number of connected components. This implementation can only be used with an undirected graph.
The main characteristics are:

The signature is for an undirected graph.

The returned values are ordered:

edge ascending


Running time: \(O(E * (V + E))\)
Signatures
pgr_bridges(Edges SQL)
RETURNS SET OF (edge)
OR EMPTY SET
 Example

The bridges of the graph
SELECT * FROM pgr_bridges(
'SELECT id, source, target, cost, reverse_cost FROM edge_table'
);
edge

1
6
7
14
17
18
(6 rows)
Parameters
Parameter 
Type 
Default 
Description 

Edges SQL 

Inner query as described below. 
Inner query
 edges SQL

an SQL query of an undirected graph, which should return a set of rows with the following columns:
Column 
Type 
Default 
Description 

id 

Identifier of the edge. 

source 

Identifier of the first end point vertex of the edge. 

target 

Identifier of the second end point vertex of the edge. 

cost 

Weight of the edge (source, target)


reverse_cost 

1 
Weight of the edge (target, source) ,

Where:
 ANYINTEGER

SMALLINT, INTEGER, BIGINT
 ANYNUMERICAL

SMALLINT, INTEGER, BIGINT, REAL, FLOAT
Result Columns
Returns set of
(edge)
Column 
Type 
Description 

edge 

Identifier of the edge that is a bridge. 
See Also

The queries use the Sample Data network.
Indices and tables