##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Cycles provide alternate paths
A back edge creates a cycle. Any edge in a cycle has an alternate path around the cycle. If tree edge has a back edge from the subtree of to an ancestor of , then is not a bridge.
The back edge provides an alternate route. If no such back edge exists, is a bridge. Removing it disconnects the subtree of from the rest of the graph. The subtree has no escape route.
