Description: 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.
To Search:
File list (Check if you may need any files):
单源最短路径Dijkstra\1.jpg
....................\2.jpg
....................\index.m
....................\main.m
....................\relax.m
....................\说明.txt
单源最短路径Dijkstra
Download