File Exchange

image thumbnail

dynamic_programming​_shortestpath

version 1.1 (3 KB) by Warut Boonphakdee
Solve the shortest path problem with dynamic programming

6 Downloads

Updated 30 Nov 2017

View License

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 : warutboon@yahoo.com

Cite As

Warut Boonphakdee (2020). dynamic_programming_shortestpath (https://www.mathworks.com/matlabcentral/fileexchange/64476-dynamic_programming_shortestpath), MATLAB Central File Exchange. Retrieved .

Comments and Ratings (1)

Updates

1.1

Rectify any mistake code

1.1.0.0

Rectify any mistake code

1.1.0.0

Rectify any mistake code

1.0.0.0

Review the name of its function file

1.0.0.0

Change its title to search easily with google

1.0.0.0

Change its title in order to search easily with google

MATLAB Release Compatibility
Created with R2011a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Tags Add Tags