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 Solvers26
Suggested Problems
-
Remove all the words that end with "ain"
2655 Solvers
-
Calculate the area of a triangle between three points
3429 Solvers
-
Create a vector whose elements depend on the previous element
790 Solvers
-
310 Solvers
-
Visualization of experimental data across a surface
41 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!
