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 Solvers22
Suggested Problems
-
Program an exclusive OR operation with logical operators
750 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
111 Solvers
-
1257 Solvers
-
Number of odd and even elements within matrix
159 Solvers
-
610 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!