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.

Solve

Solution Stats

112 Solutions

36 Solvers

Last Solution submitted on May 26, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers36

Chris Cleveland akihisa yorozu shinya matsumoto Sungsu Hur

Suggested Problems

More from this Author56

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!