☑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 F. What are the correct order of
vertices selected into the set S until the
vertex F is selected? (Each step a vertex
14
with minimal current distance is selected
into S).
A. A. E. F
Back
Next
B. A, B, C, E. F
C. A. C. E. F
D. A. B. D. F
FUO.sh
sh the exam.
9
2
11
7
10
15
