Subj : Re: Implementing A* algorithm
To   : comp.programming
From : googmeister
Date : Mon Jul 18 2005 08:10 am

> 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,

Since all the weights are the same, you can use breadth first search.
It's simpler (a queue instead of a priority queue) and faster (although
it won't make a difference for 15 node mazes).

.