Description: Prim algorithm for minimum spanning tree (adjacent table storage), with c++ description, data structure
To Search:
- [COM] - The use of COM technology from a digital
- [s20051010234334] - LSB algorithm ~ ~ one can refer to the m
- [tu3] - Create a storage structure of a given gr
File list (Check if you may need any files):
普里姆算法求最小生成树(邻接表存储)
..................................\AdjList.h
..................................\AdjListGraphLib.h
..................................\Debug
..................................\.....\main.obj
..................................\.....\vc60.idb
..................................\.....\vc60.pdb
..................................\.....\普里姆算法求最小生成树.exe
..................................\.....\普里姆算法求最小生成树.ilk
..................................\.....\普里姆算法求最小生成树.pch
..................................\.....\普里姆算法求最小生成树.pdb
..................................\main.cpp
..................................\Prim.h
..................................\SeqQueue.h
..................................\普里姆算法求最小生成树.dsp
..................................\普里姆算法求最小生成树.dsw
..................................\普里姆算法求最小生成树.ncb
..................................\普里姆算法求最小生成树.opt
..................................\普里姆算法求最小生成树.plg