Question: 36
(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, D, E, F
B. A, B, C, D, F
C. A, D, F
D. A, B, D, C, F
5
3
1
6
3
4
5
5
F
