Question: Let T be a minimum spanning tree of a graph G, and let L be the sorted list of the edge weights of T. Show
Let T be a minimum spanning tree of a graph G, and let L be the sorted list of the edge weights of T. Show that for any other minimum spanning tree T′ of G, the list L is also the sorted list of edge weights of T′.
Step by Step Solution
3.33 Rating (171 Votes )
There are 3 Steps involved in it
Suppose that LL is another sorted list of edge weights of a minimum spanning tree If L e LLL there m... View full answer
Get step-by-step solutions from verified subject matter experts
