Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Topological Sort
Bookmark
DFS
BFS (Kahn's)
Input
DAG 1
DAG 2
With cycle
Diamond
Custom
numNodes
=
6
,
edges
=
[[5,2],[5,0],[4,0],[4,1],[2,3],[3,1]]
0
1
2
3
4
5
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
U
0
U
1
U
2
U
3
U
4
U
5
Topological Order:
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
U
0
U
1
U
2
U
3
U
4
U
5
Topological Order:
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
dfs(0)
top
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
U
1
U
2
U
3
U
4
U
5
Topological Order:
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
dfs(1)
top
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
V
1
U
2
U
3
U
4
U
5
Topological Order:
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
dfs(2)
top
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
D
1
V
2
U
3
U
4
U
5
Topological Order:
1
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
dfs(2)
dfs(3)
top
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
D
1
V
2
V
3
U
4
U
5
Topological Order:
1
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
dfs(2)
top
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
D
1
D
2
D
3
U
4
U
5
Topological Order:
2
3
1
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
dfs(4)
top
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
D
1
D
2
D
3
V
4
U
5
Topological Order:
2
3
1
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
D
1
D
2
D
3
D
4
U
5
Topological Order:
4
2
3
1
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
dfs(5)
top
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
D
1
D
2
D
3
D
4
V
5
Topological Order:
4
2
3
1
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
0
1
2
3
4
5
Call Stack
State: (U=Unvisited, V=Visiting, D=Done)
D
0
D
1
D
2
D
3
D
4
D
5
Topological Order:
5
4
2
3
1
0
Legend:
Unvisited
Processing
Visiting
Visited
Cycle
algo
master
.
io
Step:
Initialize state array (U=unvisited, V=visiting, D=done)
0 / 42
Input
DAG 1
DAG 2
With cycle
Diamond
Custom
numNodes
=
6
,
edges
=
[[5,2],[5,0],[4,0],[4,1],[2,3],[3,1]]
0 / 42
algo
master
.
io
Step:
Initialize state array (U=unvisited, V=visiting, D=done)
