Kosaraju's Algorithm (Strongly Connected Components) Interactive Visualizer
Kosaraju's Algorithm finds all Strongly Connected Components (SCCs) of a directed graph in O(V + E) time using two DFS passes—one on the original graph and one on the transposed graph.
Study Kosaraju's Algorithm (Strongly Connected Components) Explanation · View Multi-Language Code · All Algorithms