Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.
Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm. Correct Answer True
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.
মোঃ আরিফুল ইসলাম
Feb 20, 2025