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
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
52479 Solvers
-
Return unique values without sorting
990 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
877 Solvers
-
60 Solvers
-
359 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!