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
-
40528 Solvers
-
5852 Solvers
-
Find relatively common elements in matrix rows
2037 Solvers
-
Number of 1s in the Binary Representation of a Number
442 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
99 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!