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 Solvers21
Suggested Problems
-
918 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2822 Solvers
-
Permute diagonal and antidiagonal
500 Solvers
-
Generate N equally spaced intervals between -L and L
943 Solvers
-
Sum of diagonals elements of a matrix
229 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!