摘要
地理信息系统(GIS)的应用经常涉及最短路径搜索问题。1959年迪杰斯特拉(Dijkstra)提出的Dijkstra算法是最适合网络拓扑中两结点间最短路径搜索的算法之一。本文讨论一般公路交通网络中两结点间的最短路径搜索问题,从核心算法方面对Dijkstra算法进行改进。
The implementation of geographic information system （GIS） often concerns with seeking shortest path. Dijkstra algorithm presented by Dijkstra in 1959 is one of the most suitable algorithms for finding the shortest path between two nodes of graphic.This paper discusses the problem that how to locate the shortest path between two nodes in conmmn tramc graphic,and presents the method of raising efficiency of Dijkstra algorithm.
出处
《计算机与现代化》
2005年第9期19-20,24,共3页
Computer and Modernization
