Prim's Algorithm is a method for calculating a minimum spanning tree. First you select any vertex and draw the edge of least weight attached to it. Then, you add the edge of least weight attached to your existing graph without creating a cycle and keep on attaching the next edge of least weight until complete.