Function bfs

javascript/0261-graph-valid-tree.js:83–89

(graph, visited, queue)

};

const bfs = (graph, visited, queue) => {
    while (!queue.isEmpty()) {
        for (let i = queue.size() - 1; 0 <= i; i--) {
            checkNeighbor(graph, visited, queue);
        }
    }
};

const checkNeighbor = (graph, visited, queue) => {
    const node = queue.dequeue();