Kosaraju's Algorithm Algorithm

In computer science, Kosaraju's algorithm (also known as the Kosaraju – Sharir algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to S. Rao Kosaraju and Micha Sharir.

Kosaraju's Algorithm source code, pseudocode and analysis