What is the name for a greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight?
- A. Kruskal's algorithm ✓
- B. Randomized algorithm
- C. Sorting stability
- D. Selection sort
Correct answer
A. Kruskal's algorithm
Explanation
Kruskal's algorithm refers to a greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight.