Biconnected components

Basic definitions

1. Basic graph definitions

Input

An undirected graph [math]\displaystyle{ G=(V,E) }[/math], which must be connected. For ease of notation and without loss of generality, we assume that [math]\displaystyle{ G }[/math] is simple.

Output

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

Known algorithms

1. Hopcroft-Tarjan