Subj : Re: Implementing A* algorithm
To   : comp.programming
From : Richard Heathfield
Date : Mon Jul 18 2005 02:52 pm

Huub <hdotvdotniekerkathccnetdotnl> wrote:

>> He means 1, the integer value that lies between 0 and 2.
>> 
> Ok. So if I summarize a bit: in my case it doesn't matter if I take
> either A* or Dijkstra, all distance-weights are 1 and the way to
> implement either algorithm is by using priority queues.
> But if all distances are the same, then what does it select the priority
> on?


The priority is a combination of the cost of entering the node and the 
estimated distance to the goal node from the current node.

-- 
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
mail: rjh at above domain

.