Expand description
Bridge finding (cut edges) via Tarjan’s DFS disc/low-link algorithm.
Functions§
- bridges
- Finds all bridges in an undirected graph using Tarjan’s algorithm.
- is_
two_ edge_ connected - Returns true if the graph has no bridges (is 2-edge-connected).