A* shortest path search algorithm visualization
Click on the boxes to start adding the start, end and barrier nodes
10 × 10
200 ms
Legend
Reset (default unset node)
Start node
End node
Barrier node
Open node (traversing yet possible over this node)
Closed node (no more traversing will happen on this node)
Path (shortest path found)
Click here to checkout the github repository.