Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
(a) True
(b) False
I have been asked this question by my college professor while I was bunking the class.
Question is from Minimum Spanning Tree in section Minimum Spanning Tree of Data Structures & Algorithms II