| Dijkstra算法在嵌入式GIS中的改进与研究 |
| |
| 引用本文： | 姜代红,戴磊. Dijkstra算法在嵌入式GIS中的改进与研究[J]. 计算机工程与应用, 2011, 47(31): 209-211. DOI: 10.3778/j.issn.1002-8331.2011.31.059 |
| |
| 作者姓名： | 姜代红 戴磊 |
| |
| 作者单位： | 徐州工程学院 信电工程学院，江苏 徐州 221008 |
| |
| 基金项目： | 江苏省高校自然科学研究计划项目基金(No.10KJD520008); 青蓝工程资助 |
| |
| 摘 要： | Dijkstra算法是求解嵌入式GIS系统中最短路径的经典算法，通过对Dijkstra算法进行分析，改变图的存储结构和搜索方法，采用基于矩形限制区域的二叉排序树改进算法，减少了内存存储空间，缩短了查询时间，在一定程度上优化了最短路径的计算过程，实际数据测试也表明了该算法的有效性。
|
| 关 键 词： | Dijkstra算法 嵌入式GIS 最短路径 矩形限制区域 二叉排序树 |
| 修稿时间： | |
Research and improvement of Dijkstra algorithm to embedded GIS system |
| |
| JIANG Daihong,DAI Lei. Research and improvement of Dijkstra algorithm to embedded GIS system[J]. Computer Engineering and Applications, 2011, 47(31): 209-211. DOI: 10.3778/j.issn.1002-8331.2011.31.059 |
| |
| Authors: | JIANG Daihong DAI Lei |
| |
| Affiliation: | School of Information and Electrical Engineering，Xuzhou Institute of Technology，Xuzhou，Jiangsu 221008，China |
| |
| Abstract: | Dijkstra algorithm is a classic algorithm to solve the shortest path in the embedded GIS system.Changing the storage structure of the graphics and the search method,Dijkstra algorithm is modified by using binary sort tree based on rectangle boundary area through analyzing algorithm.The memory space needed is decreased and the search time is shortened and the algorithm has optimized calculation process in some degree.The algorithm is achieved good results by testing some data. |
| |
| Keywords: | Dijkstra algorithm embedded GIS shortest path rectangle boundary area binary sort tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
