You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Prim’s Algorithm<br />
� Uses a priority queue Q to find a light edge<br />
quickly<br />
� Each object in Q is a vertex in V - V A<br />
� Key of v is minimum weight of any edge (u, v),<br />
where u V A<br />
� Then the vertex returned by Extract-Min is v such<br />
that there exists u V A and (u, v) is light edge<br />
crossing (V A, V – V A)<br />
� Key of v is if v is not adjacent to any vertex in<br />
V A<br />
My T. Thai<br />
mythai@cise.ufl.edu<br />
15
Change language