Kosaraju

General information

Algorithmic problem: Strongly connected components

Type of algorithm: loop

Abstract View

1. Apply a repeated depth-first search to [math]\displaystyle{ G }[/math].
2. Let [math]\displaystyle{ G' }[/math] be the transpose of [math]\displaystyle{ G }[/math].
3. Apply a repeated depth-first search to [math]\displaystyle{ G' }[/math] with a modification: The nodes are
4. The DFS trees are the strongly connected components.

Complexity

Statement: The asymptotic complexity is in [math]\displaystyle{ \Theta(|V|+|A|) }[/math].

Proof: Follows immediately from the linear asymptotic complexity of DFS.