Function bfs

javascript/0329-longest-increasing-path-in-a-matrix.js:231–247

(graph, indegree, sources, path = 0)

};

const bfs = (graph, indegree, sources, path = 0) => {
    while (!sources.isEmpty()) {
        /* Time(N * M) */
        for (let level = sources.size() - 1; 0 <= level; level--) {
            /* Time(WIDTH) */
            checkNeighbors(
                graph,
                indegree,
                sources,
            ); /* Space((N * M) + WIDTH) */
        }

        path += 1;
    }

    return path;
};

const checkNeighbors = (graph, indegree, sources) => {
    const [row, col] = sources.dequeue();