Subj : Re: Implementing A* algorithm
To   : comp.programming
From : Huub
Date : Mon Jul 18 2005 06:40 pm

> You have automatically excluded all replies from those not familiar
> with A* (whatever that may be) and/or Dijkstra's (who was a
> remarkably able programmer and probably published thousands of
> algorithms during his lifetime).  You could have described the
> algorithms or, if that is too long, given clear references to such
> descriptions.  I suspect your problems revolve around how to
> represent a node.
> 
The reason that I delete parts, is that I want to keep my posts as short 
as possible. If I delete replies about algorithms, it's either 
unintentional or I think (correctly or not) it's not really relevant.
And yes, I'm trying to figure out how to represent a node or an entire 
graph. BTW, by the answers from all of you I'm trying to figure out 
whether to use A*, Dijkstra or breadth-first. I thougt I had figured it 
out, but now I'm in doubt again. In any case I want the simplest 
algorithm for a 15 nodes graph.

Thank you.

.