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