Subj : Implementing A* algorithm
To   : comp.programming
From : Huub
Date : Mon Jul 18 2005 12:54 pm

Hi,

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.

Thank you,

Huub

.