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 a subset that divides the vector into equal halves
384 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
801 Solvers
-
497 Solvers
-
Number of odd and even elements within matrix
148 Solvers
-
Is this triangle right-angled?
5393 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!