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 Solvers42
Suggested Problems
-
220 Solvers
-
Find the largest value in the 3D matrix
1691 Solvers
-
Implement simple rotation cypher
1099 Solvers
-
Detect a number and replace with two NaN's
200 Solvers
-
Sum the numbers on the main diagonal
620 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!