## Re:Pathfinder algorithm

##### Quote

Marc Eggenberger (megge...@iiic.ethz.ch) wrote:

: Hi there ...

: for my small delphiprojekt I need to make an algorithm that gives me the

: shortest way between towns back where the towns are connected with

: streets ....

Between all towns or between one town and all other towns? This is important,

since for the first, there is a solution in O(n3) (was that Floyd?) and for

the second, in O(n2) (the Dijkstra Algorithm).

: a classic problem but before I read 10 books about this and create a

: algorithm of my own I wanted to ask if there is already a algorithm for

: Delphi there?

Why not try to get the theory right first?

Go to E{*word*277} at www.e{*word*277}.com, and search for

"+Dijkstra +Algorithm +shortest +path +problem"

(without the quotes).

Enjoy!

Ulrich Kroener