Learn
Practice
Newsletter
Resources
Mobile
New
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Depth First Search (Iterative)
Bookmark
Input
6 nodes
Cycle
Dense graph
Unreachable nodes
Custom
graph
=
[[1,2],[3,4],[5],[5],[5],[]]
,
startNode
=
0
order
0
0
1
1
2
2
3
3
4
4
5
5
start
stack
order
0
0
1
1
2
2
3
3
4
4
5
5
start
stack
order
0
0
1
1
2
2
3
3
4
4
5
5
start
current
0
stack
order
0
0
0
1
1
1
2
2
3
3
4
4
5
5
start
current
2
1
top
stack
order
0
1
0
0
1
1
1
2
2
2
3
3
4
4
5
5
start
current
2
top
stack
order
0
1
0
0
1
1
1
2
2
2
3
3
4
4
5
5
start
current
2
4
3
top
stack
order
0
1
3
0
0
1
1
1
2
2
2
3
3
3
4
4
5
5
start
current
2
4
5
top
stack
order
0
1
3
5
0
0
1
1
1
2
2
2
3
3
3
4
4
5
5
4
start
current
2
4
top
stack
order
0
1
3
5
4
0
0
1
1
1
2
2
2
3
3
3
4
4
5
5
5
4
start
current
2
top
stack
order
0
1
3
5
4
2
0
0
1
1
1
2
2
2
6
3
3
3
4
4
5
5
5
4
start
current
stack
order
0
1
3
5
4
2
0
0
1
1
1
2
2
2
6
3
3
3
4
4
5
5
5
4
start
stack
return [0, 1, 3, 5, 4, 2]
algo
master
.
io
Step:
Start DFS from node 0 using a stack
0 / 22
Input
6 nodes
Cycle
Dense graph
Unreachable nodes
Custom
graph
=
[[1,2],[3,4],[5],[5],[5],[]]
,
startNode
=
0
0 / 22
algo
master
.
io
Step:
Start DFS from node 0 using a stack
