Function buildGraph

javascript/0787-cheapest-flights-within-k-stops.js:21–34

(n, flights, src, dst, K)

});

var buildGraph = (n, flights, src, dst, K) => {
    const { graph, seen, minHeap } = initGraph(n);

    for (const [src, dst, cost] of flights) {
        graph[src].push([dst, cost]);
    }

    const priority = 0;
    const node = [priority, src, K + 1];

    minHeap.enqueue(node, priority);

    return { graph, seen, minHeap };
};

const search = (graph, src, dst, seen, minHeap) => {
    while (!minHeap.isEmpty()) {