Q. Prim’s algorithm resembles Dijkstra’s algorithm.
✅ Correct 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