What is the objective of Prim's and Kruskal's algorithms?

  • Finding the maximum flow in a network.
  • Finding the minimum spanning tree in a connected, undirected graph.
  • Finding the shortest path between two vertices in a graph.
  • Sorting the vertices of a graph in non-decreasing order of their degrees.
The main objective of Prim's and Kruskal's algorithms is to find the minimum spanning tree in a connected, undirected graph. A minimum spanning tree is a subset of the edges that forms a tree and connects all the vertices with the minimum possible total edge weight.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *