(Choose 1 answer)
Given a weighted graph below and you are using the Dijkstra algorithm to find the shortest path from the vertex H to the vertex T. What are the correct order of vertices selected into the set S until the vertex T is selected? (Each step a vertex with minimal current distance is selected into S).
4
7
6
H
4
6
6
2
T
Ex
A. H. A, B, D, T
B. H, B, D, T
C. H. C. T
D. H. A, B, C, T
1
5
