Algoritmler (animasiýa)Brauzeriňizde işleýärBarlanan sene: 1 oktýabr 2026

Breadth-First Pathfinding: animasiýa

Breadth-First Pathfinding: animasiýa. Frontend üçin animasiýaly algoritmler: tertipleme, gözleg, debounce we throttle, event loop, wirtual DOM, keş, trie we ýol gözlegi. Brauzeriňizde çalt, gizlin we ýönekeý.

Ýerliadaty ýagdaýda gizlinÇaltagza bolmak gerek däl

Aşakdaky guralyň düwmeleri we tekstleri heniz iňlis dilinde.

Graphs and textTime: O(cells)Space: O(cells)

Obstacles

Queue

Cells explored

Step 1 / 148

Breadth-first search spreads out from the start one ring at a time, so the first time it reaches the goal it has found a shortest path.

waiting to explore
explored
path
wall

JavaScript

1function bfs(grid, start, end) {
2  const queue = [start];
3  const prev = new Map([[key(start), null]]);
4  while (queue.length) {
5    const cur = queue.shift();
6    if (same(cur, end)) return buildPath(prev, cur);
7    for (const next of neighbours(grid, cur)) {
8      if (prev.has(key(next))) continue;
9      prev.set(key(next), cur);
10      queue.push(next);
11    }
12  }
13  return null;
14}

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

Loading animation...