Description: Single source shortest path Bellman-ford. The algorithm can be used to solve the general (the right side is negative) single-source shortest path problem, and dijkstra can only solve the case of non-negative weights. This algorithm uses relaxation techniques, for each vertex, to gradually reduce the source to the vertex of the estimated value until the shortest path.
To Search:
File list (Check if you may need any files):
单源最短路径Bellman-ford\1.jpg
........................\2.jpg
........................\compresstable2matrix.m
........................\main.m
........................\说明.txt
单源最短路径Bellman-ford
Download