Prim's algorithm
= Prim's algorithm
{c}
{wiki}
= Prim algorithm
{c}
{synonym}
Start from one <graph vertex>. Repeatedly add the least-weight <edge> joining the reached <graph vertices> to an unreached <graph vertex>. Each step grows a <tree> and obeys the <minimum spanning tree cut property>. On a finite connected <graph>, the result is a <minimum spanning tree>.