Subj : Re: Implementing A* algorithm
To   : comp.programming
From : Huub
Date : Wed Jul 20 2005 10:55 am

>   By the way, make sure to include attributions for material you quote 
> from other people's posts. It makes it a lot easier for your readers 
> (that is, *us*) to keep track of who said what.
I used to do that, but I find that posts are becoming "a bit" unreadable 
after some time.
>   Breadth-first search is a special case of Dijkstra's algorithm that 
> you can use when all the edges have the same weight. It just involves a 
> change of data structures; no big deal. I advise you to use the complete 
> version of Dijkstra's algorithm, so that you get practice implementing 
> it and so that you have the code if you ever need it again for more 
> complicated graphs.
That's the point: they all have the same weight, i.e. 1. I have tried to 
implement this into a C implementation I founnd on the net, but this 
fails to work. This makes me think I have to use breadth-first search 
anyway. So, I'm looking for either a C-implementation or pseudo-code I 
can use.

BTW, I've been studying the wikipedia pages on A* and Dijkstra for the 
last few days and breadth-first since yesterday.

Thank you.

.