单选题：To find the minimum spanning tree with Prim's algorithm for the

To find the minimum spanning tree with Prim's algorithm for the following graph, a sequence of vertexes 6, 1, 2, 3 was found during the algorithm's early steps. Which one vertex will be added in the next step? @[A](2)



A. 0
B. 4
C. 5
D. the vertex serial is incorrect





A.0
B.4
C.5
D.the vertex serial is incorrect


答案：A