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 Solvers18
Suggested Problems
-
22458 Solvers
-
301 Solvers
-
Number of 1s in the Binary Representation of a Number
469 Solvers
-
Matrix with different incremental runs
561 Solvers
-
interesting center of magic matrix
108 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!