there is a similarity between Prim's algortihm and Dijkstra's algorithm. The only difference is that in Dijkstra's algorithm we prioritize nodes according to their distance from the single node s, ...