AlgorithmsGraphs and textRuns in your browserReviewed October 1, 2026

A* Pathfinding Visualizer

Find a shortest path faster by guiding the search toward the goal. Interactive step-by-step animation with JavaScript code, complexity and front-end use cases.

Localprivate by defaultFastno sign-up path

Graphs and textTime: Depends on the estimate; far fewer cells than BFSSpace: O(cells)

Obstacles

Open set

Cells explored

Step 1 / 102

A* explores like Dijkstra but prefers cells that look closer to the goal (cost so far + straight-line estimate).

waiting to explore
explored
path
wall

JavaScript

1function aStar(grid, start, end) {
2  const open = [start];
3  const g = new Map([[key(start), 0]]);
4  while (open.length) {
5    open.sort((a, b) => f(a) - f(b)); // f = g + estimate
6    const cur = open.shift();
7    if (same(cur, end)) return buildPath(cur);
8    for (const next of neighbours(grid, cur)) {
9      const cost = g.get(key(cur)) + 1;
10      if (cost < (g.get(key(next)) ?? Infinity)) {
11        g.set(key(next), cost);
12        open.push(next);
13      }
14    }
15  }
16}

Tip: use the arrow keys to step and the space bar to play or pause.

Loading animation...

A* Pathfinding Visualization and Animation

Find a shortest path faster by guiding the search toward the goal. Keep an open list and the cost so far (g) for each cell. Always expand the cell with the lowest g plus the estimated distance to the goal. Update neighbours whose cost improves, and stop when the goal is chosen. Time complexity: Depends on the estimate; far fewer cells than BFS. Space complexity: O(cells). Games, maps and drag-and-drop connectors in diagram editors.

How to use A* Pathfinding Visualizer

Keep an open list and the cost so far (g) for each cell.
Always expand the cell with the lowest g plus the estimated distance to the goal.
Update neighbours whose cost improves, and stop when the goal is chosen.
Press Play, or step through with the arrow buttons and change the input to see how it reacts.

Questions

What is A* Pathfinding?

Find a shortest path faster by guiding the search toward the goal.

What is the time complexity of A* Pathfinding?

Time: Depends on the estimate; far fewer cells than BFS. Space: O(cells).

Where do front-end developers use A* Pathfinding?

Games, maps and drag-and-drop connectors in diagram editors.

Does this upload my data?

No. This converter runs in your browser for ordinary use, so the input is not sent to a backend by this tool.

Related tools

Keep working without searching again.

Sorting