Description: algorithm prim, prim algorithm was first to find a root node, and then continue to generate the minimum spanning tree, so that we can find a minimum spanning tree, if that is the case, we can use a loop to each node when as root, then repeat the tree removed, so you can find all of the minimum spanning tr
To Search:
File list (Check if you may need any files):
输出一个最小生成树\0810629.cpp
..................\0810629.txt
..................\Debug\0810629.obj
..................\.....\vc60.pdb
..................\.....\第三次作业.exe
..................\.....\第三次作业.pdb
..................\第三次作业.dsp
..................\第三次作业.dsw
..................\第三次作业.ncb
..................\第三次作业.opt
..................\第三次作业.plg
..................\Debug
输出一个最小生成树
Download