A pathfinding algorithm visualizer finds the shortest path between two points and visualizes it with animations!
A* is a type of search algorithm that is used to find the shortest path between two points in a graph. It combines the strengths of both Breadth First Search and Dijkstra's algorithm by using a heuristic function to guide the search process.
The heuristic function estimates the cost of the cheapest path from the current node to the goal node. A* prioritizes nodes that are likely to lead to the goal node, making the search process more efficient.
The green box is the start point.
The red box is the end point.
You can drag them around the board as you like.
You can also click and drag on the board to create walls.