How it works:

Prim's Algorithm is a greedy algorithm that finds the Minimum Spanning Tree (MST) of a weighted undirected graph. It starts from an arbitrary node and repeatedly adds the minimum weight edge that connects a visited node to an unvisited node until all nodes are visited.

• Algorithm Type : Greedy Algorithm
• Time Complexity : O(V² or E log V)
• Use Case : Finding minimum spanning trees in weighted graphs