finding shortest path between two points

[Schuyler Erle]

One note: You want to be careful doing this with TIGER/Line data,
because it doesn't include street-directionality, and so you can
generate driving routes that are illegal or even dangerous.

SDE

* On  4-Mar-2005 at  9:15AM PST, Stephen Woodbridge said:
> That would be Dijkstra's algorithm, see:
>
> http://ciips.ee.uwa.edu.au/~morris/Year2/PLDS210/dijkstra.html
>
> There are lots of examples of code on the net for this. I have
> implemented a prototype, but it is not opensource. You can play with the
> demo I have at
>
> http://imaptools.com/demos1/?tab=2
>
> -Steve
>
> Solomon wrote:
> >hi guys
> > thank u for ur support. now does anyone has a clue on how to implement
> >pathfinding. the user specifies source and destination, and code finds the
> >shortest distance between source and destination (like what is implemeted
> >in yahoo maps) and then the path is highlighted. am using mapserver
> >4.4.2,phpmapscript,oracle 9i spatial all running on linux. any help in the
> >right direction will be appreciated.
> >