搜索资源列表
LabeledIconWndDemo
- 使用VC++编写的城市间最短路径问题的演示程序,具有图形化界面,采用Dijkstra算法,能够生成任意两个城市间的路径长度和具体路径。-This project is programmed in VC++ to demonstrate a demo which solves shortest path problem between two cities。This program has a city network GUI, utilizes Dijkstra algorithm and c
hljsjtzzxt
- 黑龙江省交通咨询系统,可以查询13个城市中每两个城市的最短路径,最少花费和最少中转-Traffic Advisory System in Heilongjiang Province, you can check in 13 cities in the two cities each shortest path, minimum cost and minimum transit
traffic
- .建立一个全国铁路交通咨询系统,该系统具备自动查找任意两城市间铁路交通的最短路径和最少花费的功能。-. To establish a national rail transportation consulting system, the system automatically looks for any two cities with rail traffic between the shortest path and minimum cost function.
floyd
- 最短路径的floyd算法,求解某区所有n个点之间的最短距离,坐标数据和公路数据可根据自行情况设置-the finest round trip method of shortest path combination
