☑Kizspy.me
☐ A
0000
(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
with minimal current distance is
selected into S).
14
11
2
6
10
15
A. A, C, E, F
Back
Next
B. A, C, D, F
C. A, B, C, E, D. F
D. A, B, C, E, F
FUO.sh
sh the exam.
7
6
