[thelist] [MYSQL] - The most effective algorithm for the shortest path.

Ivo P ipletikosic at gmail.com
Mon Dec 12 12:36:03 CST 2005


also check this out

http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

i used it for a travel routing system project, it had a lot less nodes
than what you're describing but behaves similarly.

On 12/11/05, VOLKAN ÖZÇELİK <volkan.ozcelik at gmail.com> wrote:
> Thank you Matt and Sarah for your pointers.
>
> Matt's -to the point- reasoning obviously makes sense. It is worth a
> try. I'll discuss it with my friends.
>
> The article Sarah has pointed is also an excellent one imho, and needs
> some thorough examination (so that I may be able to grasp it fully :)
> - You're not alone Sarah :) ).
>
> This list is a great place to collaborate.
>
> Cheers,


More information about the thelist mailing list