Graph Traversal — Animate | AI Wisdom

← Back to topic
🎞 ANIMATE · Mode 3 of 5 · +100 XP— BFS & DFS
🏁Init
✅Visit
📬Enqueue
📤Dequeue
🎯 Next: Test →
Step 1 / 4
Speed
Initialise BFS
Start at A. Queue=[A]. Visited={A}💡 Analogy
Like ripples spreading in a pond — all nodes at distance 1 are visited before distance 2.
BFS explores level by level. Start by adding the root node to the queue and marking it visited.
Console Output
> queue: [A]
> visited: {A}
> order: []
●graph-traversal.ts
Initialise BFSL11–14
1const graph = {
2  A: ['B', 'C'],
3  B: ['A', 'D', 'E'],
4  C: ['A', 'F'],
5  D: ['B'],
6  E: ['B', 'F'],
7  F: ['C', 'E'],
8};
9 
10function bfs(graph: Record<string, string[]>, start: string): string[] {
11  const visited = new Set<string>();
12  const queue = [start];
13  const order: string[] = [];
14  visited.add(start);
15 
16  while (queue.length > 0) {
17    const node = queue.shift()!;         // Dequeue front (FIFO)
18    order.push(node);
19    for (const neighbor of graph[node]) {
20      if (!visited.has(neighbor)) {
21        visited.add(neighbor);
22        queue.push(neighbor);            // Enqueue unvisited
23      }
24    }
25  }
26  return order;
27}
28 
29bfs(graph, 'A'); // → ['A','B','C','D','E','F']
29 lines
Timeline — 4 Steps
Initialise BFS
Start at A. Queue=[A]. Visited={A}💡 Analogy
Like ripples spreading in a pond — all nodes at distance 1 are visited before distance 2.
BFS explores level by level. Start by adding the root node to the queue and marking it visited.
Console Output
> queue: [A]
> visited: {A}
> order: []

Start at A. Queue=[A]. Visited={A}

Start at A. Queue=[A]. Visited={A}

Was this page helpful?

Discussion

Start at A. Queue=[A]. Visited={A}

Start at A. Queue=[A]. Visited={A}

Was this page helpful?

Discussion