文件名称:44
介绍说明－－下载内容均来自于网络，请自行研究使用
dijkstra算法 目前网络上电子地图的使用很普遍。利用电子地图可以很方便地确定从一个地点到另一个地点的路径。特别地，可确定在城市中的公交换乘路线。
电子地图可以看成是一个图，而公交线路图可看成是带权有向图G =(V,E)，其中每条边的权是非负实数。-dijkstra algorithm is currently using the electronic map on the network is very common. The use of electronic maps can be easily determined from a place to another path. In particular, can be identified in the city' s bus transfer routes. Electronic map can be seen as a graph, and the bus route map can be viewed as weighted directed graph G = (V, E), in which each edge of the right of non-negative real number.
电子地图可以看成是一个图，而公交线路图可看成是带权有向图G =(V,E)，其中每条边的权是非负实数。-dijkstra algorithm is currently using the electronic map on the network is very common. The use of electronic maps can be easily determined from a place to another path. In particular, can be identified in the city' s bus transfer routes. Electronic map can be seen as a graph, and the bus route map can be viewed as weighted directed graph G = (V, E), in which each edge of the right of non-negative real number.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
44
..\4.cpp
..\44.msp
..\Debug
..\.....\4.o
..\.....\44.exe
..\4.cpp
..\44.msp
..\Debug
..\.....\4.o
..\.....\44.exe