Question: Given a graph G and a minimum spanning tree T, suppose that we decrease the weight of one of the edges in T. Show that
Show that T is a minimum spanning tree for G with edge weights given by w′.
if (u, v) # (x, y). w(u, v) w(x, y) - k if (u, v) = (x, y). w'(u, v) =
Step by Step Solution
3.43 Rating (169 Votes )
There are 3 Steps involved in it
Let wT xyer wx y We have wT wT k Consider an... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
C-S-A (189).docx
120 KBs Word File
