| Dijkstra最短路径分析算法的优化实现 |
| |
| 引用本文： | 李妍妍.Dijkstra最短路径分析算法的优化实现[J].测绘与空间地理信息,2014(5):172-173. |
| |
| 作者姓名： | 李妍妍 |
| |
| 作者单位： | 辽宁省基础测绘院,辽宁锦州121003 |
| |
| 摘 要： | 最短路径问题是地理信息系统的关键问题,传统Dijkstra算法在求解节点间最短路径时,对已标识节点以外的大量节点进行了计算,从而影响了算法的速度。因而对其算法进行优化是很有必要。本文在对传统Dijkstra算法分析的基础上,对其进行了优化,优化算法只对最短路径上节点的邻居做了处理,而不涉及其他节点,并利用Visual C++6.0开发平台编程进行了实验。实验表明,该算法是行之有效的。
|
| 关 键 词： | Dijkstra算法 最短路径 地理信息系统 |
The Optimization Algorithm Dijkstra Implementation of Shortestpath Analysis |
| |
| Institution: | LI Yan- yan (Liaoning Province Based Surveying and Mapping Institute, Jinzhou 121003, China) |
| |
| Abstract: | The shortest path problem is a key issue in geographic information system,the traditional Dijkstra algorithm for solving the shortest path between nodes,the nodes identified numerous outside was calculated,which affects the speed of the algorithm. Thus the algorithm optimization is very necessary. Based on the analysis of traditional Dijkstra algorithm,has carried on the optimization,optimization algorithm for the shortest path node neighbor for treatment,without involving other nodes,and experiments are carried out using Visual C ＋ ＋ 6. 0 software. Experiments show that,the algorithm is effective. |
| |
| Keywords: | Dijkstra algorithm shortest path geographic information system |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
