Description: This a problem in graph theory, a minimum spanning tree construction algorithm. Primm constructed by the minimum spanning tree algorithm process as follows: in all, " has landed one of its vertex spanning tree, while yet another vertex spanning tree falls on the" take a side in the right side is the smallest, one by one added to the spanning tree, until the spanning tree contains n-1 edges so far.
To Search:
File list (Check if you may need any files):
普里姆算法\Debug\graph2.obj
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\.....\普里姆算法.exe
..........\.....\普里姆算法.ilk
..........\.....\普里姆算法.pch
..........\.....\普里姆算法.pdb
..........\Debug
..........\graph2.cpp
..........\graph2.h
..........\普里姆算法.dsp
..........\普里姆算法.dsw
..........\普里姆算法.ncb
..........\普里姆算法.opt
..........\普里姆算法.plg
普里姆算法
Download