| 有向网络上两顶点间最短路径的双向搜索算法 |
| |
| 引用本文： | 李引珍 顾守淮. 有向网络上两顶点间最短路径的双向搜索算法[J]. 甘肃科学学报, 1998, 10(2): 11-14 |
| |
| 作者姓名： | 李引珍 顾守淮 |
| |
| 作者单位： | 兰州铁道学院运输系 |
| |
| 摘 要： | 提出了一种求解有向网络上两顶点间最短路径的双向搜索算法，经理论证明和实际应用，该方法较原Ｄｉｊｋｔｒａ算法可平均提高８倍的计算效率。
|
| 关 键 词： | 有向网络 最短路径 算法 双向搜索算法 |
THE TWO WAY SEARCH ALGORITHM OF THE SHORTEST PATH BETWEEN TWO VERTEXES IN A DIRECTED NETWORK |
| |
| Abstract: | The two-way search algorithm for finding the shortest path between two vertexes in a directed network in this paper is proposed. By theoretical proving and practical application, this method would evenly increase computational efficiency 8 times than Dijkstra method. |
| |
| Keywords: | directed network shortest path algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
