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 Solvers42
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6857 Solvers
-
362 Solvers
-
Project Euler: Problem 5, Smallest multiple
1679 Solvers
-
248 Solvers
-
It's going down. We're finding simbers!
90 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!