Question 26
Which minimum spanning tree algorithm uses a Disjoint-Set (Union-Find) data structure to detect cycles while greedily adding edges?
Kruskal's algorithm sorts all graph edges by weight and uses Union-Find to add edges that do not create cycles.