Applying Prim’s algorithm on a weighted graph to find a minimum spanning tree

Prim’s algorithm is based on the idea that once a particular vertex is selected the next edge of minimum weight must be connected to this vertex and as the number of selected vertices grow the edges of minimum weight can only come from these selected vertices only.