Design and Analysis of Algorithms20765 marksGreedy Algorithms
Explain Prim’s algorithm for MST problem and analyze its time complexity.
Explain Prim’s algorithm for MST problem and analyze its time complexity. [5]
A Minimum Spanning Tree (MST) of a weighted, connected, undirected graph is a spanning tree whose total edge weight is minimum among all possible spanning trees. Prim's Algorithm is a greedy algorithm that builds the MST by starting from an arbitrary vertex and repeatedly adding the minimum weigh...