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
-
2703 Solvers
-
570 Solvers
-
Make a run-length companion vector
637 Solvers
-
Create a random logical vector of N elements of which M are true.
101 Solvers
-
Back to basics - mean of corner elements of a matrix
405 Solvers
More from this Author55
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!