Function topologicalSort

javascript/0207-course-schedule.js:168–174

(graph, indegree, order = [])

};

var topologicalSort = (graph, indegree, order = []) => {
    const queue = searchGraph(graph, indegree);

    bfs(graph, indegree, queue, order);

    return order;
};

var searchGraph = (graph, indegree, queue = new Queue([])) => {
    for (const node in graph) {