##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Step-by-step execution)
Graph: , , , . Start DFS at . Visit : disc[0]=0, low[0]=0. Visit : disc[1]=1, low[1]=1. Visit : disc[2]=2, low[2]=2. Back edge : low[2]=min(2,0)=0. Backtrack to : low[1]=min(1,0)=0.
Visit : disc[3]=3, low[3]=3. Backtrack to : check low[3]=3 > disc[1]=1, so edge is a bridge. Final bridges: . All other edges are part of the cycle .
