Refer to the MST-PRIM algorithm listed below, where N=[V], and M=|E| 00 Q V MST-PRIMCV, E) 1 for each v E V: 2 dv 3 pv NIL 4. droot 0 5 #Priority Queue while Q + : EXTRACT-MINCO) for each v E Adj[u]: # (u's adjacent nodes) if v outside the tree and w(u, v)