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
-
300 Solvers
-
824 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
750 Solvers
-
Given a window, how many subsets of a vector sum positive
871 Solvers
-
Return a list sorted by number of consecutive occurrences
430 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!