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.

Key words: Dijkstra algorithm, embedded GIS, shortest path, rectangle boundary area, binary sort tree

摘要： Dijkstra算法是求解嵌入式GIS系统中最短路径的经典算法，通过对Dijkstra算法进行分析，改变图的存储结构和搜索方法，采用基于矩形限制区域的二叉排序树改进算法，减少了内存存储空间，缩短了查询时间，在一定程度上优化了最短路径的计算过程，实际数据测试也表明了该算法的有效性。

关键词: Dijkstra算法, 嵌入式GIS, 最短路径, 矩形限制区域, 二叉排序树