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 comments
Loading...
Problem Recent Solvers34
Suggested Problems
-
Determine whether a vector is monotonically increasing
23294 Solvers
-
Back to basics 21 - Matrix replicating
1813 Solvers
-
Convert a vector into a number
618 Solvers
-
Getting the indices from a vector
12207 Solvers
-
Check if number exists in vector
14254 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!
