From: fireblade
Subject: A*, Dijkstra  &  Binary Heap
Date: 
Message-ID: <1149706943.484639.175820@c74g2000cwc.googlegroups.com>
I just implemented my version of A* and Dijkstra  (Plan to add Binary
Heap  later now just plain lists) for my game pathfinding.
And  I'm curios to see how the other people implemented it to improve
my version
Anyone has a pointer  to some Common Lisp code?

thanks
bobi
From: Patrick Frankenberger
Subject: Re: A*, Dijkstra  &  Binary Heap
Date: 
Message-ID: <e679f5$pme$02$1@news.t-online.com>
fireblade wrote:
> I just implemented my version of A* and Dijkstra  (Plan to add Binary
> Heap  later now just plain lists) for my game pathfinding.
> And  I'm curios to see how the other people implemented it to improve
> my version
> Anyone has a pointer  to some Common Lisp code?

I don't have any Common Lisp code, but a link to a nice collection of 
improved algorithms and data structures for shortest path search:
http://www.avglab.com/andrew/webpub/node6.html

HTH,
Patrick
From: vanekl
Subject: Re: A*, Dijkstra & Binary Heap
Date: 
Message-ID: <1149755967.767569.140790@g10g2000cwb.googlegroups.com>
Peter Norvig's PAIP has A* and quite a few other search algorithms. The
book's source code can also be found online.

-lv


fireblade wrote:
> I just implemented my version of A* and Dijkstra  (Plan to add Binary
> Heap  later now just plain lists) for my game pathfinding.
> And  I'm curios to see how the other people implemented it to improve
> my version
> Anyone has a pointer  to some Common Lisp code?
> 
> thanks
> bobi
From: fireblade
Subject: Re: A*, Dijkstra & Binary Heap
Date: 
Message-ID: <1150050051.945419.245190@m38g2000cwc.googlegroups.com>
I'm just rewriting A* in C++ and I feel the need of first-order
functions.
Somehow I feel that Lisp is the real pure thing and other languages and

cheap imitators of some of it's features.
comp.lang.lisp / 2006 / jun