How Prim's algorithm finds spanning tree?

1.	How Prim's algorithm finds spanning tree?
Answer» Prim's algorithm treats the nodes as a single tree and keeps on adding new nodes to the spanning tree from the given graph.

Discussion