Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Breadth 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
queue
order
0
0
1
1
2
2
3
3
4
4
5
5
start
queue
order
0
0
1
1
2
2
3
3
4
4
5
5
start
current
0
queue
order
0
0
0
1
1
1
2
2
3
3
4
4
5
5
start
current
1
2
front
rear
queue
order
0
1
0
0
1
1
1
2
2
2
3
3
4
4
5
5
start
current
2
front / rear
queue
order
0
1
0
0
1
1
1
2
2
2
3
3
4
4
5
5
start
current
2
3
4
front
rear
queue
order
0
1
2
0
0
1
1
1
2
2
2
3
3
3
4
4
5
5
start
current
3
4
5
front
rear
queue
order
0
1
2
3
0
0
1
1
1
2
2
2
3
3
3
4
4
4
5
5
start
current
4
5
front
rear
queue
order
0
1
2
3
4
0
0
1
1
1
2
2
2
3
3
3
4
4
4
5
5
5
start
current
5
front / rear
queue
order
0
1
2
3
4
5
0
0
1
1
1
2
2
2
3
3
3
4
4
4
5
5
5
6
start
current
queue
order
0
1
2
3
4
5
0
0
1
1
1
2
2
2
3
3
3
4
4
4
5
5
5
6
start
return [0, 1, 2, 3, 4, 5]
algo
master
.
io
Step:
Start BFS from node 0 using a queue
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 BFS from node 0 using a queue
