Design and application of optimal path COM component based on STL

Abstract

The optimal path analysis is extended from the shortest path and is the most basic network analysis in GIS. It can provide a perfect solution for the actual problems such as logistics transportation, traffic planning, traffic analysis, bus transfer and GPS navigation. The Dijkstra algorithm is the publicly recognized as a better algorithm at home and abroad in the shortest path solution. Improved from Djikstra algorithm, this paper introduces the adjacent point and adjacent edge structure to represent a diagram and regards the weight as the trigger of the heuristic search based on the excellent computing performance of STL (Standard Template Library) and efficient memory management mechanism to complete automatic determination and extraction of the optimal path. Finally, according to the structure of the adjacent point and adjacent edge, using the programming tool of VC++ 6.0, the COM component of the optimal path is designed and implemented, and is applied in the electronic map of Tianjin to search the optimal path more quickly and efficiently.