ple Choices
(Choose 1 answer)
4
7
6
H
4
6
6
2
T
43
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).
A. H, C, T
B. H. B. D. T
C. H. A. B. D.T
D. H. A. B. C.
T
I want to nisin the exam.
1
5
