1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Prim’s algorithm resembles Dijkstra’s al...

Prim’s algorithm resembles Dijkstra’s algorithm.

A. true
B. false
Answer» A. true
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