Description: 1. Used to represent the n-connected network of n cities and between cities and communication lines may be set, including vertex network, said the city, said the two sides of the line between honest, confers the right side of the value that the corresponding cost. Smallest tree problem is to construct minimum cost connected network spanning tree.
To Search:
File list (Check if you may need any files):
注意.txt
文档.doc
工程\CreateGraph.cpp
....\Debug\CreateGraph.obj
....\.....\DeleteArc.obj
....\.....\DeleteVex.obj
....\.....\delMini.obj
....\.....\DestroyGraph.obj
....\.....\DFSTraverse.obj
....\.....\FristAdjVex.obj
....\.....\Insert.obj
....\.....\InsertArc.obj
....\.....\LocateVex.obj
....\.....\main.obj
....\.....\miniSpanTree.obj
....\.....\PutVex.obj
....\.....\testTree.obj
....\.....\vc60.idb
....\.....\vc60.pdb
....\.....\数据结构1.exe
....\.....\数据结构1.ilk
....\.....\数据结构1.pdb
....\DeleteArc.cpp
....\DeleteVex.cpp
....\DestroyGraph.cpp
....\DFSTraverse.cpp
....\FristAdjVex.asp
....\FristAdjVex.cpp
....\head.h
....\headfun.h
....\Insert.cpp
....\InsertArc.cpp
....\main.cpp
....\miniSpanTree.cpp
....\PutVex.cpp
....\testTree.cpp
....\数据结构1.dsp
....\数据结构1.dsw
....\数据结构1.ncb
....\数据结构1.opt
....\数据结构1.plg
最小生成树.exe
工程\Debug
工程
Download