Bridges & Articulation Points
Find edges and nodes that disconnect.
Fragile Spots in a Graph
Some parts of an undirected graph are critical: remove them and the graph splits apart. Finding them reveals weak links.
What a Bridge Is
A bridge is an edge whose removal increases the number of connected components. It is the only path between two regions.
All lessons in this course
- Topological Sort with Kahn's Algorithm
- Detect Cycles in Directed Graphs
- Strongly Connected Components
- Bridges & Articulation Points