A

Admin • 832.70K Points
Coach

Q. Kruskal’s algorithm is used to

  • (A) find minimum spanning tree
  • (B) find single source shortest path
  • (C) find all pair shortest path algorithm
  • (D) traverse the graph

Explanation by: Admin

the kruskal’s algorithm is used to find the minimum spanning tree of the connected graph. it construct the mst by finding the edge having the least possible weight that connects two trees in the forest.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.