Dear Mike, Thnk you for answering. Appreciate it so much. Many keypoints i can absorb from your reply, they are: "information about the interconnections between the streets, one way streets and no left/right turn situations". these are quite opening my mind.
Yet, another question arise is: how to construct the Database streets which comprise interconnctions, oneway street, straight street, curvy street, and others ? i have done an intensive search about how to create the database street, yet not find satisfying answer. does anyone know a good source on constructin the street database from scratch ? rgrds, Ecko On Fri, Mar 13, 2009 at 4:36 PM, Mike Williams <[email protected]>wrote: > > If you want to write code that will find a route, then firstly you'll > need to obtain a database of street information for your country. The > database will need to include information about the interconnections > between the streets, one-way streets and no left/right turn situations. > > It's possible that there may not be any suitable cheap street database > for Indonesia. If there were, I'd imagine that Google would be using it. > > Once you've got the data, you'd need to write the route finding code. > Dijkstra's algorithm will find routes across small databases, but for > long routes they become hopelessly slow. I believe that the D* search > algorithm might be appropriate. > > http://en.wikipedia.org/wiki/D*_search_algorithm > > -- > 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 -~----------~----~----~----~------~----~------~--~---
