Biconnected components

Input

A connected undirected graph [math]\displaystyle{ G=(V,E) }[/math].

Output

A set of sets of nodes such that each set of nodes is exactly one biconnected component.

Known algorithms

1. Hopcroft-Tarjan