Learn
Practice
Newsletter
Resources
F
Toggle theme
0
F
Toggle theme
0
Toggle menu
← Back to All Animations
Kosaraju's SCC Algorithm
Bookmark
Input
3 SCCs
2 SCCs
Simple
Custom
n
=
8
,
edges
=
[[0,1],[1,2],[2,0],[3,4],[4,5],[5,3],[6,7],[7,6],[2,3],[5,6]]
Pass 1: DFS on Original Graph
0
1
2
3
4
5
6
7
Finish Stack:
(empty)
Legend:
Unvisited
In DFS
Finished
SCC Group
algo
master
.
io
Step:
Start: Kosaraju's algorithm finds all Strongly Connected Components using two DFS passes
0 / 57
Input
3 SCCs
2 SCCs
Simple
Custom
n
=
8
,
edges
=
[[0,1],[1,2],[2,0],[3,4],[4,5],[5,3],[6,7],[7,6],[2,3],[5,6]]
0 / 57
Pass 1: DFS on Original Graph
0
1
2
3
4
5
6
7
Finish Stack:
(empty)
Legend:
Unvisited
In DFS
Finished
SCC Group
algo
master
.
io
Step:
Start: Kosaraju's algorithm finds all Strongly Connected Components using two DFS passes
