Sample JavaScript codes for DFS and BFS algorithms

[aked21]

[MJinH]

Code for BFS

const bfs = (graph, node) => {
  let visited = [];
  let nodes= [];

  nodes.push(node); 

  while (nodes.length !== 0) { 
    const newNode = nodes.shift(); 
    if (!visited.includes(newNode )) {
      visited.push(newNode ); 
      nodes= [...nodes, ...graph[newNode ]];
    }
  }
  return visited;
};

Code for DFS

const dfs = (graph, node) => {
  let stack= [];
  let queue= [];

  stack.push(node);

  while (stack.length !== 0) {
    const newNode = stack.pop();
    if (!queue.includes(newNode )) {
      queue.push(newNode );
      stack= [...stack, ...graph[newNode]];
    }
  }
  return queue;
};