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 sum of all the numbers of the input vector
55819 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1302 Solvers
-
Calculate the probability that at least two people in a group share the same birthday.
106 Solvers
-
Simple equation: Annual salary
4273 Solvers
-
69 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!