algorithms.tutorialhorizon.com

Prim's Algorithm - Minimum Spanning Tree (MST) | Algorithms

Prim's algorithm is a greedy algorithm, It finds a minimum spanning tree for a weighted undirected graph, This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.