Biconnected components: Difference between revisions

From Algowiki
Jump to navigation Jump to search
Line 1: Line 1:
== Input ==
== Input ==


A [[Basic graph definitions|connected]] [[Basic graph definitions|undirected graph]] <math>G=(V,E)</math>.
An [[Basic graph definitions|undirected graph]] <math>G=(V,E)</math>, which must be [[Basic graph definitions|connected]].


== Output ==
== Output ==

Revision as of 14:18, 30 October 2014

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