dynamic_programming​_shortestpath

Solve the shortest path problem with dynamic programming

This code was designed for solving the shortest path problem with dynamic programming approach. It can run on large-scale problem as your required. Firstly, user must write the window.m file as this stagecoach problem. example.
cost=[4 11 7 0 0 0 0 0 0 0
0 0 0 9 6 0 12 0 0 0
0 0 0 0 2 2 5 0 0 0
0 0 0 8 9 0 5 0 0 0
0 0 0 0 0 0 0 3 4 0
0 0 0 0 0 0 0 2 0 0
0 0 0 0 0 0 0 5 4 0
0 0 0 0 0 0 0 7 8 0
0 0 0 0 0 0 0 0 0 12
0 0 0 0 0 0 0 0 0 13];
[m,n]=size(cost);
[optpath,totalcost ] = dynamic_programming_shortestpath(cost,n )
If you have any questions please contact me : [e-mail]