☑Kizspy.me
(Choose 1 answer)
☐ A
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).
☐ D
A. H. B. D. T
B. H. A, B, C. T
C. H. A, B, D. T
Back
Next
D. H. C. T
FUQ.sh
sh the exam.
6
4
1
4
7
H
5
6
6
T
