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 Solvers41
Suggested Problems
-
Count from 0 to N^M in base N.
241 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2070 Solvers
-
17466 Solvers
-
792 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2145 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!
