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

To find the minimum spanning tree with Kruskal's algorithm for the following graph. Which edge will be added in the final step? @[B](2)


A. (v1,v4)
B. (v1,v2)
C. (v4,v6)
D. uncertain




A.(v1,v4)
B.(v1,v2)
C.(v4,v6)
D.uncertain


答案：B