Let M be the minimum spanning tree of a weighted graph G. Then

Let M be the minimum spanning tree of a weighted graph G. Then the path in M between V1 and V2 must be the shortest path between them in G. ~@[](2)

答案：FALSE