Introduction - If you have any usage issues, please Google them yourself
This is a used to calculate the minimum spanning tree procedure. When people enter one by one each side of the right, then click generate, will be able to get this graph minimum spanning tree.
Packet : 63535308prim.rar filelist
最小生成树\PRIM040819.clw
最小生成树\ReadMe.txt
最小生成树\PRIM040819.h
最小生成树\PRIM040819.cpp
最小生成树\StdAfx.h
最小生成树\StdAfx.cpp
最小生成树\PRIM040819.dsp
最小生成树\PRIM040819.dsw
最小生成树\PRIM040819.ncb
最小生成树\PRIM040819.plg
最小生成树\Resource.h
最小生成树\PRIM040819Dlg.cpp
最小生成树\PRIM040819Dlg.h
最小生成树\PRIM040819.APS
最小生成树\PRIM040819.rc
最小生成树\PRIM040819.opt
最小生成树\res\PRIM040819.rc2
最小生成树\res\PRIM040819.ico
最小生成树\res
最小生成树\Debug
最小生成树