Graph Traversal

1function dfs(graph, start, visited = new Set()) {
2  // Mark current node as visited
3  visited.add(start);
4  console.log(start); // Process node
5  
6  // Visit all unvisited neighbors
7  for (let neighbor of graph[start]) {
8    if (!visited.has(neighbor)) {
9      dfs(graph, neighbor, visited);
10    }
11  }
12  
13  return visited;
14}