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
-
Find the numeric mean of the prime numbers in a matrix.
8753 Solvers
-
Find state names that end with the letter A
1151 Solvers
-
Getting the absolute index from a matrix
242 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1012 Solvers
-
99 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!