Question 66
Which algorithm computes a minimum spanning tree by repeatedly choosing the smallest edge that does not create a cycle?
Kruskal sorts edges by weight and considers them in ascending order, adding an edge only when its endpoints are in different DSU components.