Shortest path problem

Pierluigi Vittori piero at innova.it
Tue Oct 19 11:55:34 PDT 1999


On ven, 15 ott 1999, Slaven Rezic wrote:

> Hello Cameron, hello Pierluigi,
> 
> I use the algorithm A* to get the shortest path between two places. I
> don't know what's the format of the mapserver data, but I think it
> should be easy to make it usable by my perl module. The module is part
> of a larger system. The sources can be found under
> 	http://pub.cs.tu-berlin.de/src/BBBike

Hello Slaven!

can you indicate any papers or other kind of references to turn to for a
theoretical background on such an issue?
I appreciate your help very much. Thanks.

Regards,
Pierluigi



More information about the MapServer-users mailing list