Home »
MCQs »
Algorithms MCQs
What is the primary goal of Kruskal's Algorithm?
11. What is the primary goal of Kruskal's Algorithm?
- To find the shortest path between two vertices
- To find the minimum spanning tree for a connected weighted graph
- To sort all edges of a graph in descending order
- To traverse a graph using a depth-first search
Answer
The correct answer is: B) To find the minimum spanning tree for a connected weighted graph
Explanation
Kruskal's Algorithm is designed to find a subset of the edges that form a tree including every vertex, where the total weight of all the edges in the tree is minimised.