| 一种限制区域的最短路径查找算法 |
| |
| 引用本文： | 周影,曹菡,李军霞. 一种限制区域的最短路径查找算法[J]. 微电子学与计算机, 2007, 24(8): 110-112 |
| |
| 作者姓名： | 周影 曹菡 李军霞 |
| |
| 作者单位： | 陕西师范大学,计算机科学学院,陕西,西安,710062 |
| |
| 摘 要： | 描述了一种路径查找中的优化算法,即限制搜索区域的最短路径算法。首先,限制了搜索范围,然后在此范围里进行最短路径的查找。实验表明此算法能够有效降低时间复杂度,从而减少了路径查找的计算时间。
|
| 关 键 词： | 限制区域搜索 Dijkstra算法 最短路径 |
| 文章编号： | 1000-7180（2007）08-0110-03 |
| 修稿时间： | 2006-11-21 |
A Shortest Route-Planning Algorithm within a Restrcited Area |
| |
| ZHOU Ying,CAO Han,LI Jun-xia. A Shortest Route-Planning Algorithm within a Restrcited Area[J]. Microelectronics & Computer, 2007, 24(8): 110-112 |
| |
| Authors: | ZHOU Ying CAO Han LI Jun-xia |
| |
| Abstract: | A optical algorithm for wayfinding has been discribted,that is a shortest path algorithm within a restricted research area. First,restricted a researche scale and make a finding in the scale. The experimental results showed that the time of complexity for the shortest path has been reduced effectively. So can it decrease the time of finding the path. |
| |
| Keywords: | restricted area research dijkstra algorithm shortest path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
