Kizspy | Question: 107
(Choose 1 answer)
1 H8I
4
1
K
3
L
1
5
6
2
J
3
3
2
M
Which are the first 4 vertices chosen when using Dijkstra algorithm to find the shortest path from G to M?
(See picture)
A. G-H-K-1
B. G-K-H-J
C. G-H-K-L
D. G-K-H-M
E. G-H-K-M
G
