Function checkNeighbors

javascript/0210-course-schedule-ii.js:85–106

(
    node,
    graph,
    color,
    topologicalOrder,
    isDirectedAcyclicGraph,
)

};

var checkNeighbors = (
    node,
    graph,
    color,
    topologicalOrder,
    isDirectedAcyclicGraph,
) => {
    for (const neighbor of graph[node]) {
        const isNew = color[neighbor] === 1; // White
        if (isNew)
            dfs(
                neighbor,
                graph,
                color,
                topologicalOrder,
                isDirectedAcyclicGraph,
            );

        const isCycle = color[neighbor] === 2; // Grey
        if (isCycle) isDirectedAcyclicGraph[0] = false;
    }
};

/**
 * https://leetcode.com/problems/course-schedule-ii/