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
Solution Comments
Problem Recent Solvers7
Suggested Problems
-
10734 Solvers
-
Cody Computer Part 4 : Are you a morning Cody player Addicted ?
66 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
196 Solvers
-
Create a vector whose elements depend on the previous element
290 Solvers
-
369 Solvers
More from this Author56
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Solution 57507
something strange with test cases 22, 23, and 25, the solution provided does not look like the shortest path (e.g. test case 22; the path 23-7-24-4-14 is shorter than the solution path 23-7-14), perhaps your solver is assuming triangular property of distances while the data provided does not have this property?
i'll look into it
I agree with you. i'm ammending my test cases now.