| 嵌入式GIS最短路径分析中Dijkstra法改进 |
| |
| 引用本文： | 王宏勇,卢战伟.嵌入式GIS最短路径分析中Dijkstra法改进[J].测绘学院学报,2005,22(1):43-45. |
| |
| 作者姓名： | 王宏勇 卢战伟 |
| |
| 作者单位： | 信息工程大学测绘学院 河南郑州450052
(王宏勇)，信息工程大学测绘学院 河南郑州450052(卢战伟) |
| |
| 摘 要： | Dijkstra算法是求解网络中最短路径的精典算法，文中通过改变图的存储结构及搜索3-法，减少了内存存储空间，缩短查询时间，以提高该算法在嵌入式GIS系统中路径优化的效率。
|
| 关 键 词： | 最短路径分析 Dijkstra算法 嵌入式GIS |
The Improvement of Dijkstra in the Embedded-GIS Route Analysis |
| |
| WANG Hong-yong,LU Zhan-wei.The Improvement of Dijkstra in the Embedded-GIS Route Analysis[J].Journal of Institute of Surveying and Mapping,2005,22(1):43-45. |
| |
| Authors: | WANG Hong-yong LU Zhan-wei |
| |
| Abstract: | Dijkstra is a classic arithmetic for net route analysis. In this paper, by banding it together with the embedded-GIS (geographic information system) characteristics, the efficiency of the best route finding arithmetic is greatly improved, the graphic storage structure and finding technique are changed, the needed memory is decreased, and the time for finding the best route is greatly shortened. |
| |
| Keywords: | the best route finding analysis dijkstra arithmetic embedded-GIS |
| 本文献已被 CNKI 维普 等数据库收录！ |
