Prim's – Minimum Spanning Tree (MST) using Adjacency List and Min Heap | Algorithms
Implementation of Prim's algorithm for finding minimum spanning tree using Adjacency list and min heap with time complexity: O(ElogV). • Prim's algorithm is a greedy algorithm. • It finds a minimum spanning tree for a weighted undirected graph.
Post to Tumblr