MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply TodayGiven 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.

6 correct solutions
14 incorrect solutions

Last solution submitted on Jul 11, 2014

3 Comments