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 Solvers41
Suggested Problems
-
Maximum running product for a string of numbers
2258 Solvers
-
Read a column of numbers and interpolate missing data
2356 Solvers
-
1363 Solvers
-
Increment a number, given its digits
690 Solvers
-
Find a subset that divides the vector into equal halves
402 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!
