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 Solvers39
Suggested Problems
-
290 Solvers
-
Return elements unique to either input
816 Solvers
-
11332 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
697 Solvers
-
Return a list sorted by number of consecutive occurrences
438 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!