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
-
Back to basics 20 - singleton dimensions
278 Solvers
-
Solve the set of simultaneous linear equations
499 Solvers
-
Implement simple rotation cypher
1096 Solvers
-
892 Solvers
-
interesting center of magic matrix
111 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!