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
- 
         
         655 Solvers 
- 
         Find the sum of the elements in the "second" diagonal 1174 Solvers 
- 
         Detect a number and replace with two NaN's 195 Solvers 
- 
         Lychrel Number Test (Inspired by Project Euler Problem 55) 104 Solvers 
- 
         Volume of a sphere given its surface area 152 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!