Depth-First Search (DFS)

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