F
11
6
2
14
6
9
10
15
(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).
A. A, B, C, E, F
B. A, C, D, F
C. A, C, E, F
7
D. A, B, C, E, D, F
36
