Function searchGraph

javascript/0210-course-schedule-ii.js:148–154

(graph, indegree, queue = new Queue([]))

var isSource = (count) => count === 0;

var searchGraph = (graph, indegree, queue = new Queue([])) => {
    for (const node in graph) {
        if (isSource(indegree[node])) queue.enqueue(node);
    }

    return queue;
};

var bfs = (graph, indegree, queue, reversedOrder = []) => {
    while (!queue.isEmpty()) {