On Nov 13, 7:18 pm, Informagence <[EMAIL PROTECTED]> wrote: > I could calculate routes for all possible combinations and then pick > the shortest route, but the permutations are mind-bogglingly large > when you get past 5 or 6 waypoints.
Yes. It's called the Travelling Salesman Problem. Searching for that will find some posts with useful information about it (among all the others which say what the problem is called) Andrew --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/Google-Maps-API?hl=en -~----------~----~----~----~------~----~------~--~---
