Kosaraju SCC Solver
TraversalMediumExtract strongly connected components (SCC) on directed graphs using dual DFS.
Alt+Shift+S
Configuration Panel
Set edges to "Directed" on the canvas controls, build components cycles, and click run.
Complexity Mappings
Time ComplexityO(V + E) dual DFS passes
Space ComplexityO(V + E) transpose adjacency list
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
Strongly Connected Components (SCC) are maximal subgraphs in a directed graph where every vertex is reachable from any other vertex in the subgraph.
Algorithm Mechanism
Kosaraju's algorithm runs two DFS sweeps: first to order vertices by finish times; second on the transpose (reversed edge) graph processing nodes in reverse finish order to isolate components.
Source: CP-Algorithms reference guide