algorithms.tutorialhorizon.com
Prim's - Minimum Spanning Tree (MST) using Adjacency Matrix | Algorithms
Implementation of Prim's algorithm for finding minimum spanning tree using Adjacency matrix with time complexity O(|V|2), Prim's algorithm is a greedy algorithm.