Description:
The application of an undirected graph
Task: If the five-way communications network, said network between n cities construction plan, the vertices represent cities, said the right side of the line cost, design a plan to make the lowest total cost of this communications network.
Tip: This is a minimum spanning tree problem. n cities weights on each side of the name and entered by the user to establish the adjacency matrix, then Prim algorithm to find the minimum spanning tree, and then output the program.
To Search:
File list (Check if you may need any files):
kcsj
....\Debug
....\.....\kcsj.exe
....\.....\kcsj.ilk
....\.....\kcsj.pch
....\.....\kcsj.pdb
....\.....\prim.obj
....\.....\vc60.idb
....\.....\vc60.pdb
....\kcsj.dsp
....\kcsj.dsw
....\kcsj.ncb
....\kcsj.opt
....\kcsj.plg
....\prim.cpp
Download