Q. Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
✅ Correct Answer: (B)
false
Explanation: 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.