OJ Board

What are the differences betwen Dijkstra and A*

A* uses a heuristic to guide it's search. The only difference is what value you use for nodes on the priority queue. In Dijkstra you order nodes with their distance from the start node. In A* you simply add a heuristic value which estimates the distance from the current node to the goal. This way the search will choose likely nodes first. As long as the heuristic is admissible (never pessimistic, less than or equal to the real distance) the solution found will be optimal.

How can i use A* in Pascal ?

hi, every body

i think that Nak must add this note that the A* is optimally efficient
it means that if u use an unit heuristic in some different algorithms including A*, the A* will use the minimum time to find it

Best regards,
Shahab Tasharrofi