Single source shortest path Dijkstra
2016-08-23
1 0 0
4.0
Other
Earn points
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.
matlab
dijkstra
短路
单源
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment