Question: Suppose that graph G has two different MSTs, T1 and T2. Show that for each edge cost c, T1 and T2 contain the same number
Suppose that graph G has two different MSTs, T1 and T2. Show that for each edge cost c, T1 and T2 contain the same number of edges with cost c (8 pts). Hint: use an exchange-like argument. In this question, the edge costs may not be distinct. That is, there can be more than one edges having the same cost
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
