Multiple Choices
3
11
21
6
5
2
2
11
(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. D. B
B. A, C, E, B
C. A. C. B
D. A, C, D, E, B
