##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Single edge and cycles)
Single edge: , connections .
The edge is a bridge. Output: .
Complete cycle: , connections .
No bridges. Output: .
Star graph: , connections .
All edges are bridges because each leaf has only one connection. Output: all edges.
Disconnected graph: problem guarantees connected, but if not, run DFS from each component.
