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
-
6079 Solvers
-
Back to basics 6 - Column Vector
1101 Solvers
-
Create a square matrix of multiples
495 Solvers
-
Return elements unique to either input
803 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
103 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!