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 Solvers24
Suggested Problems
-
Extract leading non-zero digit
2246 Solvers
-
1440 Solvers
-
156 Solvers
-
938 Solvers
-
Detect a number and replace with two NaN's
199 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!