Dijkstra's Flight Engine

Airport

    Explanation

    Merge Sort

    Sorting every flight to show only the busiest few is for demonstration; a min-heap holding just the top N would find them without ordering the rest.