Pseudocode

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