bridges

scirs2_graph::algorithms::connectivity

Function bridges 

Source 
pub fn bridges<N, E, Ix>(graph: &Graph<N, E, Ix>) -> Vec<(N, N)>
where
    N: Node + Debug,
    E: EdgeWeight,
    Ix: IndexType,
Expand description

Finds all bridges (cut edges) in an undirected graph

A bridge is an edge whose removal increases the number of connected components.

§Arguments

  • graph - The undirected graph to analyze

§Returns

  • A vector of bridges, where each bridge is represented as a tuple of nodes