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
-
Given two arrays, find the maximum overlap
1551 Solvers
-
Sum of first n terms of a harmonic progression
429 Solvers
-
241 Solvers
-
Compute a dot product of two vectors x and y
997 Solvers
-
Given a window, how many subsets of a vector sum positive
855 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!