Subj : Re: Implementing A* algorithm To : comp.programming From : CBFalconer Date : Mon Jul 18 2005 04:09 pm Huub wrote: > > First, I'm programming in C. I'm not a real good programmer, and I > have a route problem. I have a robot that has to find the shortest > route through a maze. Options for doing this are either the A* or > Dijkstra's algorithm. My maze consists of 15 nodes, with each node > only connected to at least 1 of it's direct neighbours. All > distances between the nodes are the same. Since wikipedia tells me > that A* is faster than Dijkstra, I would like to know how the > weights work out for either a linked list or an array? > > I hope my question is clear enough. 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. -- Chuck F (cbfalconer@yahoo.com) (cbfalconer@worldnet.att.net) Available for consulting/temporary embedded and systems. USE worldnet address! .