##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Running Tarjan's algorithm)
Trace on input , edges : DFS from : disc[0]=0, low[0]=0. Visit : disc[1]=1, low[1]=1. Visit : disc[2]=2, low[2]=2. Back edge : low[2]=0. Backtrack: low[1]=0.
Visit : disc[3]=3, low[3]=3. Backtrack: check low[3]=3 > disc[1]=1, add to result. Bridges: . This is the only edge whose removal disconnects the graph.
