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
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15822 Solvers
-
Remove any row in which a NaN appears
8796 Solvers
-
Omit columns averages from a matrix
620 Solvers
-
192 Solvers
-
Pernicious Anniversary Problem
843 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!