Depth First Search (DFS) Graph Traversal in Javascript

dfs.js

const nodes = [
  {
    links: [ 1 ], // node 0 is linked to node 1
    visited: false
  }, {
    links: [ 0, 2 ], // node 1 is linked to node 0 and 2
    visited: false
  },
  ...
 ];


const dfs = start => {
  const listToExplore = [ start ];

  nodes[ start ].visited = true;

  while ( listToExplore.length ) {
    const nodeIndex = listToExplore.pop();

    nodes[ nodeIndex ].links.forEach( childIndex => {
      if ( !nodes[ childIndex ].visited ) listToExplore.push( childIndex );
      nodes[ childIndex ].visited = true;
    } );
  }
};

dfs( 0 );

DFS uses stacks, stacks are LIFO (push, pop).

Breadth first uses queues, queues are FIFO (shift, unshift or enqueue and dequeue).

DFS ---> Stack ---> By storing the vertices in a stack, the vertices are explored by lurching along a path, visiting a new adjacent vertex if there is one available.
BFS ----> Queue ----> By storing the vertices in a queue, the oldest unexplored vertices are explored first.

great!