Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Dijkstra's Shortest Path Algorithm
Bookmark
Input
4 Nodes
5 Nodes
6 Nodes
Custom
graph
=
{"A":[["B",1],["C",4]],"B":[["A",1],["C",2]],"C":[["A",4],["B",2],["D",3]],"D":[["C",3]]}
,
source
=
A
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
∞
∞
∞
Distances:
A
0
B
∞
C
∞
D
∞
Visited:
(none)
Min-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
∞
∞
∞
Distances:
A
0
B
∞
C
∞
D
∞
Visited:
(none)
Min-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
curr
0
∞
∞
∞
Distances:
A
0
B
∞
C
∞
D
∞
Visited:
A
Min-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
curr
0
1
∞
∞
Distances:
A
0
B
1
C
∞
D
∞
Visited:
A
Min-Heap (Priority Queue):
(1, B)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
curr
1
4
∞
Distances:
A
0
B
1
C
4
D
∞
Visited:
A
B
Min-Heap (Priority Queue):
(4, C)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
curr
1
4
∞
Distances:
A
0
B
1
C
4
D
∞
Visited:
A
B
Min-Heap (Priority Queue):
(4, C)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
1
curr
3
∞
Distances:
A
0
B
1
C
3
D
∞
Visited:
A
B
C
Min-Heap (Priority Queue):
(4, C)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
1
curr
3
∞
Distances:
A
0
B
1
C
3
D
∞
Visited:
A
B
C
Min-Heap (Priority Queue):
(4, C)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
1
curr
3
6
Distances:
A
0
B
1
C
3
D
6
Visited:
A
B
C
Min-Heap (Priority Queue):
(6, D)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
1
3
curr
6
Distances:
A
0
B
1
C
3
D
6
Visited:
A
B
C
D
Min-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
Dijkstra's Shortest Path (source: A)
1
4
2
3
A
B
C
D
0
1
3
curr
6
Distances:
A
0
B
1
C
3
D
6
Visited:
A
B
C
D
Min-Heap (Priority Queue):
(empty)
Legend:
Unvisited
Current
Checking
Visited
algo
master
.
io
Step:
Initialize distances: source "A" = 0, all others = ∞
0 / 28
Input
4 Nodes
5 Nodes
6 Nodes
Custom
graph
=
{"A":[["B",1],["C",4]],"B":[["A",1],["C",2]],"C":[["A",4],["B",2],["D",3]],"D":[["C",3]]}
,
source
=
A
0 / 28
algo
master
.
io
Step:
Initialize distances: source "A" = 0, all others = ∞
