文件名称:zhoumao
介绍说明－－下载内容均来自于网络，请自行研究使用
换乘次数最少是乘客出行时考虑的首要因素。描述了传
统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段
距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Descr iption of the traditional Dijkstra algorithm. and analysis of the Dijkstra algorithm is not suitable for transit network optimal path of choice. Finally, according to transit passengers will be able to walk away from a transfer above the actual situation, A proposed change to the least number of public transport operators to improve the shortest path
统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段
距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Descr iption of the traditional Dijkstra algorithm. and analysis of the Dijkstra algorithm is not suitable for transit network optimal path of choice. Finally, according to transit passengers will be able to walk away from a transfer above the actual situation, A proposed change to the least number of public transport operators to improve the shortest path
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 49636966zhoumao.rar 列表 zhoumao.cpp