Strongly connected components

From Algowiki
Revision as of 15:23, 4 November 2014 by Flomm (talk | contribs)
Jump to navigation Jump to search

Input

A directed graph [math]\displaystyle{ G=(V,A) }[/math].

Output

A set of sets of nodes. Each set of nodes contains exactly the nodes of one SCC. The correspondence between the SCC and these sets of nodes is one-to-one.

Known algorithms

  1. Kosaraju