🔗 Strongly Connected Components
Visualize Kosaraju's Algorithm
1. DFS on G
2. Transpose G
3. DFS on G
T
Kosaraju's Algorithm:
(1) Run DFS on G, record finish order. (2) Compute transpose G
T
. (3) Run DFS on G
T
in reverse finish order. Each DFS tree = one SCC.
Click "Next Step" to begin finding SCCs
📚 Finish Stack
🔗 SCCs Found
Unvisited
Visiting
Current
🔄 Reset
Next Step →
▶️ Auto Play