Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
What does Kruskal's algorithm do to build a minimum spanning tree?
A
Remove the heaviest edge repeatedly
B
Run DFS and keep back edges
C
Grow a tree from a start node with a heap
D
Sort edges by weight and add each edge unless it forms a cycle, using union-find