Function bfs

javascript/0207-course-schedule.js:185–191

(graph, indegree, queue, order)

};

var bfs = (graph, indegree, queue, order) => {
    while (!queue.isEmpty()) {
        for (let i = queue.size() - 1; 0 <= i; i--) {
            checkNeighbors(graph, indegree, queue, order);
        }
    }
};

var checkNeighbors = (graph, indegree, queue, order) => {
    const node = queue.dequeue();