[Fwd: Shortest path problem]

[Slaven Rezic]

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

Regards,
	Slaven

-- 
use Tk;$c=tkinit->Canvas(-he,20)->grid;$x=5;map{s/\n//g;map{$c->create('line'=>
map{$a=-43+ord;($x+($a>>3)*2=>5+($a&7)*2)}split//)}split/!/;$x+=12}split/_/=>'K
PI1_+09IPK_K;-OA1_+K!;A__1;Q!7G_1+QK_3CLPI90,_+K!;A_+1!KQ!.N_K+1Q!.F_1+KN.Q__1+
KN._K+1Q!.F_1+KN.Q_+1Q__+1!KQ!.N_1;Q!7G_K3,09Q_+1!K.Q_K+1Q!.F_1+KN.Q_';MainLoop