Quote:
Originally posted by jayant@Aug 9 2003, 07:13 AM
also,
suppose we have a direct route from A-B .
will there be a possibility that the there exists routes A-C and C-B such that Distance(A-B) > Distance(A-C) + Distance(C-B)
hence shortest distance from A to B will be via C and not the direct path.
If Distance(A-B) > Distance(A-C) + Distance(C-B) has to be considered then good tours cannot be found in small times.
|
That's correct direct routes do NOT always mean the shortest route. And the shortest route wins over shortest time (as long as execution time is not exceeded
