Dijkstra's and A* Search Algorithms for Pathfinding with Obstacles

search algorithm

Dijkstra

*

A

algorithm step

1

starting point

end point

obstacles

1 square

This Demonstration finds the shortest path between two green points across a field of black obstacles using either Dijkstra's algorithm or A* search. The process of the search algorithm is shown stepwise, with tiles becoming highlighted as they are scanned. The final path, after the process is complete, is shown in red. You can vary the positions of the starting and end points, the layout of the obstacles and the search algorithm.