Improvement of Algorithm of Shortest Route and the Object Oriented Practicing Method
Gong Jiehui Bai Ling Gao Jianmei
Shortest route analysis is the fundamental network analysis function in GIS. The algorithm of Dijkstra is an acknowledged better algorithm of shortest route. In this paper, starting from the view of economizing in memory space and increasing operation speed, and based on the algorithm of Dijkstra, the algorithm of relative edges is improved, and the algorithm of adjacent nodes is put forward. The object oriented practicing method is also given here.
【CateGory Index】： P283.7