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
-
Remove all the words that end with "ain"
2402 Solvers
-
2064 Solvers
-
Make a random, non-repeating vector.
9795 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
101 Solvers
-
Volume of a sphere given its surface area
151 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!