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 Solvers38
Suggested Problems
-
Read a column of numbers and interpolate missing data
2355 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Replace all zeros and NaNs in a matrix with the string 'error'
104 Solvers
-
364 Solvers
-
Number of Even Elements in Fibonacci Sequence
1683 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!
