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

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

.