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 Solvers23
Suggested Problems
-
Given a window, how many subsets of a vector sum positive
871 Solvers
-
mathematics , probability problem
70 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
13640 Solvers
-
Find out missing number from a vector of 9 elements
321 Solvers
-
130 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!
