How it works:

Kruskal's Algorithm is a greedy algorithm that finds the Minimum Spanning Tree (MST) of a weighted undirected graph. It sorts all edges by weight and repeatedly adds edges with smallest weights while avoiding cycles (using Union-Find) until all nodes are connected.

• Algorithm Type : Greedy Algorithm
• Time Complexity : O(E log E)
• Data Structure : Union-Find (Disjoint Set Union)
• Use Case : Finding minimum spanning trees in weighted graphs