this is not a homework but I need to understand it before my exam tomorrow.
How to prove by contradiction that a minimum spanning tree of a graph G is unique if all the edge weights in G are distinct?
you can assume that the graph has two distinct MST.
Any help is appreciated. Thank you