Answer (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 is the label of the vertex D when the shortest path from H to T is determined?
A. 11
B. infinity
C. 9
D. 10
4
7
6
1
4
H
5
6
6
2
T
Exit 14
