Hi, Tristram Graebener wrote: > The performances of A* strongly depends on the heuristic. > If you have THE perfect heuristic that knows exactly the smallest > *distance* to the destination, then the A* will iterate only the nodes > of the shortest path.
Eh? Of course A* will have to look at more nodes than those on the shortest path, even if the exact smallest distance to the destination is known beforehand. Bye Frederik _______________________________________________ Routing mailing list [email protected] http://lists.openstreetmap.org/listinfo/routing
