文件名称:traffic
介绍说明－－下载内容均来自于网络，请自行研究使用
通过对图的应用,建立一套交通网络图,实现对求单源最短路径,任意两个城市间的最短路径的查询.
首先根据邻接矩阵和图的知识建立交通网络图，顶点信息存储城市道路信息，由图的最短路径查询城市间的最短道路，输出到达路径。
-Through the diagram, the establishment of a transportation network map, to achieve for single-source shortest path between any two cities in the shortest path inquiries. First of all, the basis of adjacency matrix and map knowledge to establish the transport network maps, information storage vertex of Urban Roads information, by the shortest path map query the shortest inter-city roads, to reach the path of the output.
首先根据邻接矩阵和图的知识建立交通网络图，顶点信息存储城市道路信息，由图的最短路径查询城市间的最短道路，输出到达路径。
-Through the diagram, the establishment of a transportation network map, to achieve for single-source shortest path between any two cities in the shortest path inquiries. First of all, the basis of adjacency matrix and map knowledge to establish the transport network maps, information storage vertex of Urban Roads information, by the shortest path map query the shortest inter-city roads, to reach the path of the output.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
交通咨询 .cpp