Maximum spanning tree using Prim's algorithm

Question

How would this algorithm be changed to give a maximum spanning tree?

MST_prim(G,w,r)
for each u that exists in G.V
   u.key= inf 
   u.pi=NIL
r.key=0
Q=G.V
Wh