Implementation Approaches to Shortest Path Searching: a Case Study of DijKstar Algorithm
Cao Jianchen · Standardization of Surveying and Mapping · 2005
There are several algorithms in graph theory to implement shortest path searching, and the most typical and common one is DijKstar algorithm. To implement network shortest path searching in GIS, we should first abstract geometrical network describing spatial information in GIS as the logical network depicting the associations between or among the spatial features, then abstract class objects used for programming implementation from the above, and finally, implement shortest path searching by using specific shortest path algorithm (such as DijKstar).