Prove that there is a unique minimum spanning tree on a connected undirected graph when the edge weights are unique.
=============================================================================== Makes intuitive sense but yet, I'm having a hard time trying to prove it. I tried induction but I'm stuck...... any suggestions? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
