(Recursive) Depth First Search & Breadth First Search

dfs-bfs.js

function dfs (x) {
  x.visited = true
  adjacent(x)
    .forEach(y => y.visited || dfs(y))
}

// :: List Node -> List Node
function bfs0 (xs) {
  xs.forEach(x => { x.visited = true })
  return (!xs.length)
    ? xs
    : xs.concat(
        bfs0(xs.flatMap(
          x =>
            adjacent(x)
              .filter(y => !y.visited)
        ))
      )
}

function bfs (graph) {
  return bfs0([pickSource(graph)])
}