Finding biconnected components in an undirected graph

Revision en4, by rachitiitr, 2016-05-29 21:01:48

The following problem deals with finding the biconnected components in an Undirected graph and treating them as vertices. The code provided in editorial isn't easy for me to understand. Can someone share a template code for how to find biconnected components?
The code given on GeeksforGeeks finds the edges in a biconnected component. I do not trust it as in the solution given there, he talks about cross-edge and stuff. Cross-edge in undirected graph?
Link to the Problem --> Problem E. Pursuit For Artifacts


  Rev. Lang. By When Δ Comment
en4 English rachitiitr 2016-05-29 21:01:48 2 Tiny change: '? \nThe (code](http' -> '? \nThe [code](http'
en3 English rachitiitr 2016-05-29 21:01:10 2 Tiny change: 'ed graph? \nLink to' -> 'ed graph? \nLink to'
en2 English rachitiitr 2016-05-29 21:00:41 26 Tiny change: ' graph? \n\n[Problem E' -> ' graph? \nLink to the Problem --> [Problem E'
en1 English rachitiitr 2016-05-29 20:59:48 693 Initial revision (published)