STRONGLY$-$CONNECTED$-$COMPONENTS $($G$)$

$1.$ Call DFS $($G$)$ to compute finishing times f$($u$)$ for each vertex u

$2.$ Compute GT

$3.$ Call DFS $($GT

$),$ but in the main loop of DFS$,$ consider the vertices in order of decreasing f$($u$)$

$4.$ Output the vertices of each tree in the depth$-$first forest formed in line $3$ as a separate strongly

connected component

A B

D E

G H F

C