Strongly Connected Components (Kosaraju's Algorithm)

Find the strongly connected components of a directed graph using Kosaraju''s algorithm: do a DFS pushing nodes onto a stack by finish time, transpose the graph, then pop from the stack running DFS on the transpose to enumerate SCCs.