Kosaraju's Algorithm
A strongly connected component, or SCC, of a directed graph is a maximal
Tarjan's Algorithm
Tarjan's algorithm finds all strongly connected components of a directed
Strong Connected Components
Strong connected components algorithms