breadthFirst.js

breadthFirst(startingNode, neighborVisit) {
      const firstNode = this.searchNode(startingNode)
      const visitedNode = nodes.reduce((sum, node) => {
        sum[node.id] = false
        return sum
      }, {})
      const queue = queueCreator()
      queue.add(firstNode)
      while (!queue.empty()) {
        const temp = queue.remove()
        if (!visitedNode[temp.id]) {
          neighborVisit(temp)
          visitedNode[temp.id] = true
        }
        temp.neighbors.forEach(node => {
          if(!visitedNode[node.id]) {
            queue.add(node)
          }
        })
      }
    }