Biconnected components

Input

An undirected graph [math]\displaystyle{ G=(V,E) }[/math], which must be connected.

Output

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

Known algorithms

1. Hopcroft-Tarjan