Skip to main content

bridges

graphos_adapters::plugins::algorithms

Function bridges 

Source 
pub fn bridges(store: &LpgStore) -> Vec<(NodeId, NodeId)>
Expand description

Finds bridges (cut edges) in the graph.

A bridge is an edge whose removal disconnects the graph. Uses Tarjan’s algorithm with low-link values.

§Arguments

  • store - The graph store (treated as undirected)

§Returns

List of bridges as (source, target) pairs.

§Complexity

O(V + E)