Talk:TADM2E 1.3
From Algorithm Wiki
Revision as of 05:53, 29 May 2016 by Sparkguy2016 (talk | contribs) (→error in solution?: new section)
Proposed solution
a———————b——c
Perhaps I am misunderstanding the question…
However, this seems far more elegant
Design/draw a road network with two points a and b such that the fastest route between a and b is not the shortest route.
Henry (talk) 19:25, 11 September 2015 (EDT)
error in solution?
I may be wrong but I think there is a typo in the proposed solution.
dist(a,d)=5 miles
dist(c,b)=5 miles
So the distance from a to b through d is 10 miles. Assuming you drive 30 miles per hour, the time to travel this would be 20 minutes, but due to the busy intersection at d, you are delayed 15 minutes, the total time would be 35 minutes.
Shouldn't it be:
dist(a,d)=5 miles
dist(d,b)=5 miles
d instead of c right?
