☑Kizspy.me
☐ A
(Choose 1 answer)
Given a weighted graph below and you are using
the Dijkstra algorithm to find the shortest path from
the vertex A to the vertex B. What are the
correct order of vertices selected into the set S
until the vertex B is selected? (Each step a vertex
with minimal current distance is selected into S).
A. A. C. B
B. A, C, D, E, B
C. A. C. E. B
D. A. C. D. B
FUO.sh
sh the exam.
3
21
21
6
11
5
11
