文件名称：Project3 Battle Over Cities
文件大小：34KB
文件格式：RAR
更新时间：2017-05-07 05:30:25
C 数据结构 战争树结构
Using structs to store each city’s message. Using Disjkstra algorithm to find the minimum distance to repair the necessary highways to guarantee all the cities are connected. Using Kruskal algorithm to get the minimum cost and get know the city to which we must pay maximum cost.
【文件预览】：
code
----Readme.txt(537B)
----project3.exe(200KB)
----project3.cpp(4KB)