A

Admin • 833K Points
Coach

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

  • (A) true
  • (B) false
  • (C) ---
  • (D) ---

Explanation by: Admin

prim’s algorithm outperforms the kruskal’s algorithm in case of the dense graphs. it is significantly faster if graph has more edges than the kruskal’s algorithm.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.