Problem 458. Parcel Routing
Given a matrix that represent the distance along highways between major cities numbered 1 to N, provide the path and shortest distance from a given city, from, to a given city, to. Assume that 0 represents no direct path between two cities. If there is no solution to the problem, return -1 for both the path and the distance.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers21
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15764 Solvers
-
Maximum running product for a string of numbers
2251 Solvers
-
Getting the absolute index from a matrix
254 Solvers
-
10026 Solvers
-
What's the missing interior angle?
91 Solvers
More from this Author56
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!