MAD101_-_Test3_-_FA_2024_2915.webp

Kizspy | Question: 44
(Choose 1 answer)
Find the first 3 vertices when using Dijkstra's algorithm to find the shortest path from A to Z.
A. A-B-E B. A-B-C
C. A-B-D
D. A-B-Z
FUOVERFLOW
9
3
3
zQ
3
E. None of the other choices is correct
7
2
2
8
4