Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
The Maze II
Bookmark
BFS
Dijkstra
Input
5x5 Maze A
5x5 Maze B
4x4 Simple
Custom
maze
=
[[0,0,1,0,0],[0,0,0,0,0],[0,0,0,1,0],[1,1,0,1,1],[0,0,0,0,0]]
,
start
=
[0, 4]
,
destination
=
[4, 4]
W
0
W
W
W
W
W
D
queue
Open
Wall
Start
Dest
Visiting
W
0
W
W
W
W
W
D
queue
Open
Wall
Start
Dest
Visiting
W
1
0
W
2
W
W
W
W
D
(0,3)
front / rear
queue
Open
Wall
Start
Dest
Visiting
W
1
0
2
W
2
W
W
W
W
D
queue
Open
Wall
Start
Dest
Visiting
6
W
1
0
5
2
3
6
W
2
W
W
W
W
D
(0,0)
(2,0)
front
rear
queue
Open
Wall
Start
Dest
Visiting
6
W
1
0
5
2
3
6
W
2
W
W
W
W
D
(2,0)
front / rear
queue
Open
Wall
Start
Dest
Visiting
6
7
W
1
0
5
2
3
6
9
8
W
2
W
W
W
W
D
(2,2)
(2,1)
front
rear
queue
Open
Wall
Start
Dest
Visiting
6
7
W
1
0
5
9
2
3
6
9
8
W
2
W
W
W
W
10
D
(1,2)
(4,2)
front
rear
queue
Open
Wall
Start
Dest
Visiting
6
7
W
1
0
5
9
2
3
6
9
8
W
2
W
W
W
W
10
D
(4,2)
front / rear
queue
Open
Wall
Start
Dest
Visiting
6
7
W
1
0
5
9
2
3
6
9
8
W
2
W
W
W
W
12
10
12
(4,4)
front / rear
queue
Open
Wall
Start
Dest
Visiting
6
7
W
1
0
5
9
2
3
6
9
8
W
2
W
W
W
W
12
10
12
queue
Open
Wall
Start
Dest
Visiting
algo
master
.
io
Step:
Start: Find shortest distance in 5x5 maze from (0,4) to (4,4). Initialize distance[start] = 0, all others = infinity.
0 / 228
Input
5x5 Maze A
5x5 Maze B
4x4 Simple
Custom
maze
=
[[0,0,1,0,0],[0,0,0,0,0],[0,0,0,1,0],[1,1,0,1,1],[0,0,0,0,0]]
,
start
=
[0, 4]
,
destination
=
[4, 4]
0 / 228
algo
master
.
io
Step:
Start: Find shortest distance in 5x5 maze from (0,4) to (4,4). Initialize distance[start] = 0, all others = infinity.
