The one bridge holding two halves of the city together
Remove most edges from a graph and it stays connected through some other path. Remove a bridge edge and the graph splits in two — finding that edge is what this lesson is about.
After this lesson
You should be able to
- Identify a bridge edge in a small graph.
- Define a biconnected component.
- Explain why identifying bridges matters for network reliability.
Try it before you read
Try it live
Some roads matter more than others
A city built on two riverbanks might have five roads on the north side and five on the south side, all interconnected, but only one bridge crossing the river between them. Close any one of the ten local roads and traffic reroutes fine. Close the bridge, and the two halves of the city cannot reach each other at all — no rerouting is possible, because no other path exists.
An edge whose removal disconnects the graph is called a bridge. The D-E edge in the widget below is exactly this kind of edge — remove it and the A-B-C-D cluster can no longer reach the E-F-G cluster at all.
A biconnected component: a cluster with a backup route
A biconnected component is a cluster of vertices where every pair has at least two independent paths between them — remove any single vertex from the cluster, and everyone else in it can still reach everyone else. The A-B-C-D cluster in the widget is exactly this: A and D can reach each other via A-B-D or via A-C-D, so losing any one vertex in that cluster does not disconnect the rest.
A bridge, by contrast, connects two different biconnected components rather than sitting inside one — which is why losing it is so much more damaging than losing an edge inside a well-connected cluster.
Biconnected: A - B - D - C - A (a cycle: any one vertex can be removed
and the rest stay connected)
Bridge: D --- E (the only edge joining the two clusters —
removing it disconnects the whole graph)Why this matters beyond road maps
The same idea protects real networks: an internet backbone provider wants no single failed cable to split the internet in two, so network engineers specifically look for and eliminate bridges by adding redundant links. A biconnected component in a social network is a tightly-knit friend group; a bridge connecting two such groups is often exactly the one 'mutual friend' relationship that holds two otherwise separate social circles together.
Try it yourself
Using the widget below, run BFS from A in undirected mode to confirm all seven vertices are reachable, then explain in words which single edge you would need to add to make the graph biconnected as a whole.
Need a hint?
You need a second, independent path between the A-B-C-D cluster and the E-F-G cluster — one that does not reuse D or E.
Check the worked solution
Adding one edge between any vertex in {A, B, C} and any vertex in {F, G} — for example, B-F — creates a second route between the two clusters that does not pass through D or E. After that addition, removing D-E no longer disconnects the graph, because the new edge provides the backup path a true biconnected structure requires.
Quick check
What happens to a graph's connectivity when a bridge edge is removed?
Why this lesson exists
Syllabus mapping
Bi connected Components
Maps to course outcomes CO1, CO4.