In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to ano

A*算法（DTM格式数据） GIS环境下用到的最短路径算法模块，支持带权图和二值图，改进过，收敛速度不错 （实验室做的算法，请勿用于商业用途）-A* algorithm (DTM format data) GIS environment, shortest path algorithm used in modules to support a weighted graph and a binary image, improving over, a good convergence rat