Introduction - If you have any usage issues, please Google them yourself
prim algorithm: You can start from any node to find the smallest connected node weight, connectivity, the connected node as a whole, and other nodes of the right value, and then find out the smallest weight node to connect, and then connect the node to do a whole look, and so on until all nodes all connected to code, test data.
Packet : 109201264prim.rar filelist
prim\prim.out
prim\prim.in
prim\prim.cpp
prim\prim.bmp
prim