In Prim’s algorithm, the adjacent vertices must be selected whereas Kruskal’s algorithm does not have this type of restrictions on selection criteria. Example of Prim’s Algorithm Let us find the Minimum Spanning Tree of the following graph using Prim’s algorithm. ...