Two Kinds of Improved Path Planning Algorithms in GIS Spatial Analysis
Wang Teng-jun · Surveying and Mapping of Geology and Mineral Resources · 2008
Based on the analysis of the tradition Dijkstra algorithm's and Branch-and-bound search algorithm,an improved algorithm is given.The experiment in the VC programming shows that the improved Dijkstra algorithm can decrease the computing of uncorrelated nodes and enhances the calculation efficiency and the improved algorithm can find the more optimum path.