Strongly connected components: Difference between revisions

From Algowiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
Line 1: Line 1:
== Basic definitions ==
# [[Basic graph definitions]]
== Input ==
== Input ==



Latest revision as of 19:07, 9 November 2014

Basic definitions

  1. Basic graph definitions

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