Function bfs

graphs/possible-bipartition.js:27–49

(source, adjList, colors)

module.exports = possibleBipartition;

function bfs(source, adjList, colors) {
  const queue = [source];
  colors[source - 1] = 0;

  while (queue.length > 0) {
    const node = queue.shift();

    if (adjList[node] !== undefined) {
      for (const neighbor of adjList[node]) {
        // if there is a conflict return false.
        if (colors[neighbor - 1] === colors[node - 1]) {
          return false;
        }
        if (colors[neighbor - 1] === -1) {
          colors[neighbor - 1] = 1 - colors[node - 1];
          queue.unshift(neighbor);
        }
      }
    }
  }

  return true;
}

function createAdjacencyList(edges) {
  const list = {};