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
-
2715 Solvers
-
Renaming a field in a structure array
1577 Solvers
-
Project Euler: Problem 5, Smallest multiple
1645 Solvers
-
Find the largest value in the 3D matrix
1657 Solvers
-
Determine Whether an array is empty
808 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!