Wasn't it Nishant who wrote:
>
>Me and my two friends are developing this system as a part of our
>college project.
>Our city is a very large one with 800+ bus stops.
>
>The method Mike has suggested is similar to Dijkstra's Shortest Path
>Algorithm.
>But the problem is we cannot implement it for 800+ nodes as it'll be
>inefficient.

I reckon that it will easily be fast enough if you perform the work on 
the server particularly if you use a compiled language rather than an 
interpreted script.

-- 
Mike Williams
http://econym.org.uk/gmap



--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---

Reply via email to