Q36_218_20250805105419.webp

☑Kizspy.me
(Choose 1 answer)
☐ A
Find the first 3 vertices when using
Dijkstra's algorithm to find the
shortest path from A to Z.
A. None of the other choices is
correct
☐ E
B. A-B-C
C. A-B-E
D. A-B-D
E. A-B-Z
FUQ.sh
sh the exam.
2
7
8
3
0
3
2
3
N