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 Solvers25
Suggested Problems
-
Select every other element of a vector
36339 Solvers
-
171 Solvers
-
631 Solvers
-
Compute a dot product of two vectors x and y
1050 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
256 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!
