Prim's Algorithm (Minimum Spanning Tree) Interactive Visualizer
Prim's Algorithm grows a Minimum Spanning Tree one vertex at a time by greedily adding the cheapest edge connecting the visited tree to an unvisited vertex.
Study Prim's Algorithm (Minimum Spanning Tree) Explanation · View Multi-Language Code · All Algorithms