In order to get the minimal spanning tree of this graph by Kruskal Algorithm, the number of remaining edges is (D), and in ascending order of weight, we should remain the edge ( ) with the weight of 5 in order to avoid circle.

In order to get the minimal spanning tree of this graph by Kruskal Algorithm, the number of remaining edges is (D), and in ascending order of weight, we should remain the edge ( ) with the weight of 5 in order to avoid circle.
选项:5; (v3, v4)

5; (v2, v3)

6; (v1, v4)

6; (v2, v3)