Category:Prim's Algorithm

This category contains pages concerning Prim's Algorithm:

The purpose of this algorithm is to produce a minimum spanning tree $T$ for any given weighted graph $G$.

Step 1: Choose any vertex of $G$, and add it to $T$.

Step 2: Add an edge of minimum weight $e$ to join a vertex in $T$ to one not in $T$.

Step 3: If $T$ is a spanning tree $G$, stop. Otherwise, go to Step 2.

Source of Name

This entry was named for Robert Clay Prim.