Breadth-First Search (BFS)

1function bfs(graph, startNode) {
2  const visited = new Set([startNode]);
3  const queue = [startNode];
4  const result = [];
5 
6  while (queue.length > 0) {
7    const node = queue.shift(); // Dequeue front
8    result.push(node);
9 
10    const neighbors = graph[node] || [];
11    for (const neighbor of neighbors) {
12      if (!visited.has(neighbor)) {
13        visited.add(neighbor);
14        queue.push(neighbor); // Enqueue
15      }
16    }
17  }
18 
19  return result;
20}
21 
22// Example usage:
23// const graph = { A: ['B', 'C'], B: ['D'], C: ['E'], D: [], E: [] };
24// bfs(graph, 'A'); // ['A', 'B', 'C', 'D', 'E']