networkDelayTime = (times, n, k) => {
    const { graph, maxTime, queue } = buildGraph(times, n, k);

    bfs(queue, graph, maxTime, k);

    return checkAns(maxTime);
}
Graph - BFS
Queue - Space (WIDTH)
Array - Greedy
https://leetcode.com/problems/network-delay-time/
@param {number[][]} times
@param {number} n
@param {number} k
@return {number}