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 Solvers38
Suggested Problems
-
Extract leading non-zero digit
2253 Solvers
-
Back to basics 22 - Rotate a matrix
939 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
775 Solvers
-
Create a square matrix of multiples
502 Solvers
-
Calculate the derivative of a polynomial
240 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!
