Prim's Algorithms for minimum spanning trees in pseudo$-$code is given as: PRIM$($V$,$ E$,$ w$,$ r$)$ Q $$ for each u in V do k e y$[$u$]\backslash$infty $\backslash$pi $[$u$]$ NIL INSERT $($Q$,$ u$)$ DECREASE$-$KEY $($Q$,$ r$,0)$ while Q $!=$ do u $$EXTRACT$-$MIN$($Q$)$ for each v in A d j$[$u$]$ do if v in Q and w$($u$,$ v$)$