dynamic_programming_shortestpath
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 (2024). dynamic_programming_shortestpath (https://www.mathworks.com/matlabcentral/fileexchange/64476-dynamic_programming_shortestpath), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- MATLAB > Mathematics > Linear Algebra >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.1 | Rectify any mistake code
|
|
|
1.0.0.0 | Review the name of its function file
Change its title to search easily with google |