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 Solvers12
Suggested Problems
-
Find the sum of the elements in the "second" diagonal
1173 Solvers
-
Sort numbers by outside digits
156 Solvers
-
Return elements unique to either input
789 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
390 Solvers
-
195 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!