Algoritmlar (animatsiya)Brauzeringizda ishlaydiTekshirilgan sana: 1-oktabr, 2026

A* Pathfinding animatsiyasi

A* Pathfinding animatsiyasi. Front-end uchun animatsiyali algoritmlar: saralash, qidirish, debounce va throttle, event loop, virtual DOM, kesh, trie va yoʻl topish. Brauzeringizda tez, maxfiy va oson ishlaydi.

Mahalliystandart holatda maxfiyTezroʻyxatdan oʻtish shart emas

Quyidagi tool tugmalari va matnlari hozircha ingliz tilida.

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...