Minimum Spanning Tree Algorithms

Greedy approach: Sort all edges by weight and add them one by one to the MST.

Union-Find: Use disjoint set data structure to detect cycles.

Time Complexity: O(E log E) where E is the number of edges.

1. Sort all edges in ascending order by weight
2. For each edge, check if it creates a cycle using Union-Find
3. If no cycle, add edge to MST
4. If cycle detected, skip the edge
5. Continue until MST has V-1 edges