单源最短路径Dijkstra。使用图论算法作为图像处理的基础算法，Dijkstra和Bellman-Ford类似，都是解决单源最短路径问题，不同的是这个方法只能解决边为非负的问题，实现的好的Dijkstra算法运行时间要快于Bellman-ford。-Single source shortest path Dijkstra. Using graph theory algorithm as the basis of image processing algorithms, Dijkstra and Bellman-Ford similar, are single-source shortest path problem to solve, except that this method can only solve the problem of non-negative side, to achieve a good running time of Dijkstra' s algorithm faster than Bellman-ford.