计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (28): 128-129.DOI: 10.3778/j.issn.1002-8331.2008.28.043

• 数据库、信号与信息处理 • 上一篇    下一篇

嵌入式GIS最短路径分析中Dijkstra算法的改进

王玉琨,吴 锋   

  1. 河南理工大学 计算机学院,河南 焦作 464200
  • 收稿日期:2007-11-19 修回日期:2008-03-03 出版日期:2008-10-01 发布日期:2008-10-01
  • 通讯作者: 王玉琨

Improvement of Dijkstra in Embedded-GIS route analysis

WANG Yu-kun,WU Feng   

  1. Department of Computer,Henan Polytechnic University,Jiaozuo,Henan 464200,China
  • Received:2007-11-19 Revised:2008-03-03 Online:2008-10-01 Published:2008-10-01
  • Contact: WANG Yu-kun

摘要: Dijkstra算法是求解网络中最短路径的经典算法,文中通过改变图的存储结构及搜索方法,减少了内存存储空间,缩短了查询时间,以提高该算法在嵌入式GIS(Geographic Information System)系统中路径优化的效率。并将该算法应用在嵌入式焦作市地理信息公众查询系统中,取得满意的效果。

关键词: 最短路径分析, Dijkstra算法, 嵌入式

Abstract: Dijkstra is a classic arithmetic for net route analysis.By banding it together with the embedded GIS 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.Applying this algorithm into “Geographic Information System for Communal Query of Jiaozuo City” system,gains satisfying result.

Key words: the best route finding analysis, Dijkstra arithmetic, embedded