[plt-scheme] A* algorithm?

From: Jens Axel Soegaard (jensaxel at soegaard.net)
Date: Mon Apr 27 19:30:38 EDT 2009

> On Mon, Apr 27, 2009 at 3:09 PM, Doug Orleans <dougorleans at gmail.com 
> <mailto:dougorleans at gmail.com>> wrote:
> 
>     Is there an implementation of the A* search algorithm in PLT Scheme?
>     There's a PLaneT package for Dijkstra's algorithm, but I didn't find
>     A*.  If not, I'll probably use the dijkstra package as a starting
>     point, unless someone has a better suggestion.

 From an 2008 ICFP Contest submission courtesy of Google's CodeSearch.

http://www.google.com/codesearch/p?hl=en#KCquXJsNsQ0/submission/icfp08/src/scheme/libraries/search/astar.ss&q=%22astar.ss%22


-- 
Jens Axel Søgaard


Posted on the users mailing list.