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. Prim's algorithm treats the nodes as a single tree and keeps on adding new nodes to the spanning tree from the given graph.

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.

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