algorithms.tutorialhorizon.com
Prim's – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key | Algorithms
Implementation of Prim's algorithm for finding minimum spanning tree using Adjacency list and priority queue. • Prim's algorithm is a greedy algorithm.