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
-
Return the largest number that is adjacent to a zero
5508 Solvers
-
Program an exclusive OR operation with logical operators
748 Solvers
-
899 Solvers
-
Unique values without using UNIQUE function
437 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2032 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!