There's nothing in the API that does that. If that really is what you want, then you'll need to code it yourself. It's not too hard.
However I don't think that Dijkstra's algorithm is actually what you want. Dijkstra's algorithm finds the shortest path through a network from a specified start point to a specified destination. What it doesn't do is visit all the nodes. In particular, if you start with a complete graph (all links from one point to another are permitted) then the Dijkstra's algorithm should always choose to take the direct link from the start point to the destination point, because the shortest path is a straight line. Perhaps what you're looking for is a solution to the Travelling Salesman problem. Be warned, however, that the TSP is computationally NP-Hard. If you've got more than a handful of points it could take an awfully long time to obtain a solution. -- http://econym.googlepages.com/index.htm 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 -~----------~----~----~----~------~----~------~--~---
