Show that if all the weights in a connected weighted graph G are distinct, then there is exactly one minimum spanning tree for G
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.