An effective cost distance calculation based on raster data model improved algorithm

In many applications of geographic information science, we often need to calculate the shortest path from the source point to the target points. Network data model can be computed using the graph theory algorithm, when faced with raster data model, the grid cells of raster will be treated as network model nodes in general, and the eight neighborhood unit of each grid cell will be treated as the direct neighbor nodes in network model. Some scholars have pointed out that this algorithm which network model directly transplanted easily lead to the wrong direction in path finding and the high cumulative cost value problem, and gives the improved algorithm called wave spread cost distance algorithm. In this paper, we research and make experiments with the wave spread cost distance algorithm and then carried out further improvements, making the analysis of exception handling and the algorithm overall efficiency has been improved.