中文说明：matlab练习程序（单源最短路径Dijkstra） 图的相关算法也算是自己的一个软肋了，当年没选修图论也是一大遗憾。图像处理中，也有使用图论算法作为基础的相关算法，比如图割，这个算法就需要求最大流、最小割。所以熟悉一下图论算法对于图像处理还是很有帮助的。Dijkstra和Bellman-Ford 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报
English Description：
MATLAB training program (single source shortest path problem, Dijkstra) algorithms of graph can be considered a weakness themselves when no optional graph theory is a great pity. In image processing, using correlation algorithm based on graph algorithms, such as graph-cut, this algorithm requires maximum flow, minimum cut requirements. So familiarize yourself with graph theory algorithms for image processing is very helpful. Similar to Dijkstra and Bellman-Ford, are single-source shortest path problem, the difference is only a side for non-negative solution of the problem with this approach, implementation of the Dijkstra algorithm run much faster than Bellman-ford.