1 votes 1 votes 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$. Algorithms descriptive isi2014-pcb-cs algorithms spanning-tree graph-algorithms + – go_editor asked May 31, 2016 go_editor 702 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
3 votes 3 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. Ml_Nlp answered Oct 15, 2016 Ml_Nlp comment Share Follow See 1 comment See all 1 1 comment reply neeraj_bhatt commented Sep 13, 2020 reply Follow Share It’s greedy right? 0 votes 0 votes Please log in or register to add a comment.