Kosaraju's Algorithm for Strongly Connected Components
Find strongly connected components using the two-pass Kosaraju's algorithm with graph transpose and DFS finishing times.
Find strongly connected components using the two-pass Kosaraju's algorithm with graph transpose and DFS finishing times.
Find strongly connected components in directed graphs using DFS-based Tarjan's algorithm with lowlink values.