next up previous
Next: Example Up: CSE 2320: Algorithms and Previous: Strongly Connected Components

Pseudocode

SCC(G)
$\;\;\;\;\;$DFS(G) to compute finishing times
$\;\;\;\;\;$compute GT
$\;\;\;\;\;$DFS(GT) considering vertices in main loop in
$\;\;\;\;\;$ $\;\;\;\;\;$ $\;\;\;\;\;$decreasing order by finish time
$\;\;\;\;\;$output each tree in DFF of T as a SCC



Copyright © 1998 The University of Texas at Arlington