Here we have discussed how to solve a minimum spanning tree problem using Prim’s algorithm. The objective is to find a minimum spanning tree network from a given network arrangement of nodes. Spanning Tree and Minimum Spanning Tree What are the steps of Prim’s algorithm? The steps for implementing Prim’s algorithm are as follows: Initialize the minimum spanning tree with a vertex chosen at random. Find all the edges that connect the tree to new vertices, find the minimum and add it to the tree. Keep repeating step 2 until we get a minimum spanning tree.