单选题：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? @[B](2)



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




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


答案：B