Function bfs

javascript/0210-course-schedule-ii.js:156–164

(graph, indegree, queue, reversedOrder = [])

};

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

    return reversedOrder.reverse();
};

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