A Kth shortest path algorithm implemented with bi-directional search
文献类型：EI期刊论文
| 作者 | Lu Feng |
| 发表日期 | 2008 |
| 关键词 | Algorithms Computational efficiency Trees (mathematics) |
| 英文摘要 | A new Kth shortest path algorithm based on bidirectional search is set forward in this paper. Based on the classical Dijkstra's shortest path algorithm, the presented algorithm conducts the path searching both from the source and destination nodes at the same time, and constructs the shortest path trees in positive and reverse sequence alternately so to populate several reasonable shortest paths between the start and destination nodes. The principle and implementation of the algorithm is described in detail and time complexity is analyzed. The efficiency and accuracy are verified with a real road network. |
| 出处 | Geomatics and Information Science of Wuhan University
 |
| 卷 | 33期:4页:418-421 |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.igsnrr.ac.cn/handle/311030/24921]  |
| 专题 | 地理科学与资源研究所_历年回溯文献 |
| 推荐引用方式 GB/T 7714 | Lu Feng. A Kth shortest path algorithm implemented with bi-directional search. 2008. |
入库方式： OAI收割
来源：地理科学与资源研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。