Function search

javascript/0787-cheapest-flights-within-k-stops.js:36–52

(graph, src, dst, seen, minHeap)

};

const search = (graph, src, dst, seen, minHeap) => {
    while (!minHeap.isEmpty()) {
        const [cost, city, stops] = minHeap.dequeue().element;

        seen.set(city, stops);

        const isTarget = city === dst;
        if (isTarget) return cost;

        const canSkip = stops <= 0;
        if (canSkip) continue;

        checkNeighbors(graph, cost, city, stops, seen, minHeap);
    }

    return -1;
};

var checkNeighbors = (graph, cost, city, stops, seen, minHeap) => {
    for (let [nextCity, nextCost] of graph[city]) {