Description: Software Design course work minimum spanning tree algorithm minimum spanning tree data structure diagram is an important application of its requirements from a weighted undirected complete graph, select n-1 edges make this figure is still connected ( ie get a spanning tree), but also consider the rights of the smallest tr
To Search:
File list (Check if you may need any files):
PrimKruska
..........\最小生成树kru
..........\.............\CodeFile.txt
..........\.............\Debug
..........\.............\.....\ddd.exe
..........\.............\.....\ddd.ilk
..........\.............\.....\ddd.obj
..........\.............\.....\ddd.pch
..........\.............\.....\ddd.pdb
..........\.............\.....\vc60.idb
..........\.............\.....\vc60.pdb
..........\.............\Textfile.txt
..........\.............\ToBeTran.txt
..........\.............\ddd.cpp
..........\.............\ddd.dsp
..........\.............\ddd.dsw
..........\.............\ddd.exe
..........\.............\ddd.ncb
..........\.............\ddd.o
..........\.............\ddd.opt
..........\.............\ddd.plg
..........\.............\hfmTree.txt
..........\最小生成树prim
..........\..............\cs.cpp
..........\..............\cs.dsp
..........\..............\cs.dsw
..........\..............\cs.exe
..........\..............\cs.ncb
..........\..............\cs.o
..........\..............\cs.opt
Download