how to find maximum spanning tree using prims algorithm?

Question

I want to modify Prim's algorithm so that it find the maximum spanning tree how can this be done

NPE · Accepted Answer · 2011-10-24 16:55:21Z

1

Prim's algorithm doesn't mind negative weights.

Simply flip the sign of every edge's weight, and use the minimum spanning tree algorithm.

answered Oct 24, 2011 at 16:55

NPE

503k114 gold badges970 silver badges1k bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

are you sure that it does not assume that you cannot decrease the "weight" of the tree by adding new branches?

bashrc · Accepted Answer · 2011-12-03 10:04:08Z

0

Even going greedy for maximum edge instead of minimum edge will help.

answered Dec 3, 2011 at 10:04

bashrc

4,8451 gold badge27 silver badges49 bronze badges