Prim's Algorithm

1. Choose a starting vertex
2. Add the edge connect to the vertex into queue
3. Find the edge with minimum weight and that is not yet in the tree
4. Add the edge and the vertex to the tree
5. Repeat steps above

For more details: GeeksForGeeks.