Biconnected components: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Input == An undirected graph <math>G=(V,E)</math>. == Output == A set of sets of nodes such that each set of nodes is...") |
(→Input) |
||
| Line 1: | Line 1: | ||
== Input == | == Input == | ||
A [[Basic graph definitions|connected]] [[Basic graph definitions|undirected graph]] <math>G=(V,E)</math>. | |||
== Output == | == Output == | ||
Revision as of 14:17, 30 October 2014
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.