Greets!

Is there a module for the A* algorithm? (Shortest path between 2
Vertices in a graph)

I tried Google and CPAN search, but apparently my search-foo is weak today.

/peter

Peter Ludikovsky <darthludi [at] gmail.com> wrote in
news:1208165832.632353 [at] nntpcache01.si.eunet.at:

> Greets!
>
> Is there a module for the A* algorithm? (Shortest path between 2
> Vertices in a graph)

Does

http://search.cpan.org/~jhi/Graph-0.84/

help?

Sinan

--
A. Sinan Unur <1usa [at] llenroc.ude.invalid>
(remove .invalid and reverse each component for email address)

comp.lang.perl.misc guidelines on the WWW:
http://www.rehabitation.com/clpmisc/