Answer
Showing that there is a unique minimum spanning tree in a connected weighted graph if the weights of the edges are all different.
Work Step by Step
If all edges have different weights,
- then a contradiction is obtained in the proof that Prim’s algorithm works when an edge ek+1 is added to T and an edge e is deleted,
- instead of possibly producing another spanning tree.
