Description: This a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the minimum spanning tree structure.
To Search:
File list (Check if you may need any files):
Prim
....\Prim.cpp
....\Prim.dsp
....\Prim.ncb
....\Prim.plg
....\Prim.dsw
....\Prim.opt
....\Debug
pudn.txt
Download