0 votes
95 views
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
asked | 95 views

## 1 Answer

0 votes

Sorry, I'm not able to upload the protrait version of the image .

It is just some changes in the Minimum spanning tree algo.Correct me if I'm wrong.

answered by (331 points)

0 votes
1 answer
1
0 votes
0 answers
2
+1 vote
1 answer
3