Which of the following best describes Kruskal's algorithm?
- A. A greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight. ✓
- B. A method of analyzing algorithms that determines the average time or space cost over a sequence of operations.
- C. An algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights.
- D. An algorithm that uses a degree of randomness as part of its logic to achieve good average-case performance.
Correct answer
A. A greedy algorithm that finds a minimum spanning tree for a connected, weighted graph by adding edges in increasing order of weight.
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.