[Fwd: Shortest path problem]

[Pierluigi Vittori]

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

Hi Slaven!

I have just taken a look at the address you sent and things look VERY
interesting!
I am going to study it more carefully but for now I just wanted to say thank
you very much for your help.

Regards,
Pierluigi