Question

Prim’s algorithm resembles  Dijkstra’s algorithm.

(a) True

(b) False

I had been asked this question in quiz.

Question is from Minimum Spanning Tree in division Minimum Spanning Tree of Data Structures & Algorithms II

Answer 1

Correct answer is (a) True

Best explanation: In Prim’s algorithm, the MST is constructed starting from a single vertex and adding in new edges to the MST that link the partial tree to a new vertex outside of the MST. And Dijkstra’s algorithm also rely on the similar approach of finding the next closest vertex. So, Prim’s algorithm resembles Dijkstra’s algorithm.