Parcel Routing - MATLAB Cody - MATLAB Central

Problem 458. Parcel Routing

Difficulty:
(5)
Rate

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

26.98% Correct | 73.02% Incorrect
Last Solution submitted on Apr 19, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers12

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!