Given a weighted graph G = (V, E, w). Suppose that we want tofind a spanning tree with maximum weight, instead of a minimum one.Design an algorithm ( pseudo C code ) for finding a maximumspanning tree, and show that your algorithm is correct.( givesimple example )
Expert Answer
An answer will be send to you shortly. . . . .