| 基于移动定位信息的最短路径搜索算法 |
| |
| 引用本文： | 胡明,赵婉婷. 基于移动定位信息的最短路径搜索算法[J]. 数字社区&智能家居, 2009, 0(32) |
| |
| 作者姓名： | 胡明 赵婉婷 |
| |
| 作者单位： | 长春工业大学;计算机科学与工程学院; |
| |
| 摘 要： | 该文利用改进的Dijkstra算法求出车辆行驶的最短路径,并根据道路限定的车速,交通异常信息等对所求的最短路径进行分析,最终得到所用时间和距离最短的最短路径。
|
| 关 键 词： | Dijkstra算法 最短路径 交通异常信息 |
Based on the Mobile Pitch Information of the Algorithm for Shortest-path Searching |
| |
| HU Ming,ZHAO Wan-ting. Based on the Mobile Pitch Information of the Algorithm for Shortest-path Searching[J]. Digital Community & Smart Home, 2009, 0(32) |
| |
| Authors: | HU Ming ZHAO Wan-ting |
| |
| Affiliation: | HU Ming,ZHAO Wan-ting (Changchun University of Technology,Department of Computer Science , engineering,Changchun 130000,China) |
| |
| Abstract: | Make use of Dijkstra work out the shortest-path of the car run, and base the rate of the road limit, traffic exception information to analyses the shortest-path, at the end, find the shortest-path which use the least time and the shortest path. |
| |
| Keywords: | dijkstra arithmetic shortest-path traffic exception information |
| 本文献已被 CNKI 等数据库收录！ |
|
