Function checkNeighbors

javascript/0787-cheapest-flights-within-k-stops.js:54–64

(graph, cost, city, stops, seen, minHeap)

};

var checkNeighbors = (graph, cost, city, stops, seen, minHeap) => {
    for (let [nextCity, nextCost] of graph[city]) {
        const hasSeen = seen.has(nextCity) && stops - 1 <= seen.get(nextCity);
        if (hasSeen) continue;

        const priority = cost + nextCost;
        const node = [priority, nextCity, stops - 1];

        minHeap.enqueue(node, priority);
    }
};