Biconnected components: Difference between revisions
Jump to navigation
Jump to search
(→Input) |
(→Input) |
||
| Line 1: | Line 1: | ||
== Input == | == Input == | ||
An [[Basic graph definitions|undirected graph]] <math>G=(V,E)</math>, which must be [[Basic graph definitions#Connectedness|connected]]. | An [[Basic graph definitions|undirected graph]] <math>G=(V,E)</math>, which must be [[Basic graph definitions#Connectedness|connected]]. For ease of notation and without loss of generality, we assume that <math>G</math> is [[Basic graph definitions|simple]]. | ||
== Output == | == Output == | ||
Revision as of 12:40, 31 October 2014
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.