Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
|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.|
Login to Continue
It will take less than 2 minutes