A

Admin • 831.35K Points
Coach

Q. Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
Explanation by: Admin
prim’s algorithm and kruskal’s algorithm perform equally in case of the sparse graphs. but kruskal’s algorithm is simpler and easy to work with. so, it is best suited for sparse graphs.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.