Wasn't it marcelo who wrote: > >I'm not sure if this helps, but the Travelling Salesman Problem sounds >very similar: >http://www.gebweb.net/optimap/
That's moving in the wrong direction. The basic Chinese Postman problem is solvable in polynomial time but the Travelling Salesman problem is NP-Complete. Also, although the two situations sound similar, solving one doesn't help you solve the other. The underlying road intersection information is not available from Google. For the USA, such information is available in the Tiger database from the US Census Bureau. -- http://econym.org.uk/gmap The Blackpool Community Church Javascript Team --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
