×

Multiple-Choice Questions

Web Technologies MCQs

Computer Science Subjects MCQs

Databases MCQs

Programming MCQs

Testing Software MCQs

Digital Marketing Subjects MCQs

Cloud Computing Softwares MCQs

AI/ML Subjects MCQs

Engineering Subjects MCQs

Office Related Programs MCQs

Management MCQs

More

Advertisement


What is the primary goal of Kruskal's Algorithm?

11. What is the primary goal of Kruskal's Algorithm?

  1. To find the shortest path between two vertices
  2. To find the minimum spanning tree for a connected weighted graph
  3. To sort all edges of a graph in descending order
  4. 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.

Comments and Discussions!

Load comments ↻






Copyright © 2024 www.includehelp.com. All rights reserved.