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