单选题：Use Dijkstra algorithm to find the shortest paths from 1 to ever

Use Dijkstra algorithm to find the shortest paths from 1 to every other vertices. In which order that the destinations must be obtained? @[A](2)



A. 6, 7, 5, 3, 2, 4
B. 6, 2, 5, 7, 3, 4
C. 2, 3, 4, 5, 6, 7
D. 2, 4, 3, 6, 5, 7




A.6, 7, 5, 3, 2, 4
B.6, 2, 5, 7, 3, 4
C.2, 3, 4, 5, 6, 7
D.2, 4, 3, 6, 5, 7


答案：A