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 Solvers24
Suggested Problems
-
30124 Solvers
-
Sort a list of complex numbers based on far they are from the origin.
5798 Solvers
-
Find relatively common elements in matrix rows
2151 Solvers
-
1182 Solvers
-
Make a random, non-repeating vector.
11226 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!