Dlight acheduling algorithm
A-14.4 Suppose you are given a timetable, which consists of the following: . A set A of n airports, and for each airport a e A, a minimum connecting time c(a) . A set F of m flights, and the following, for each flight feF o Origin airport a1(f) E A o Destination airport a2(f) E A o Departure time t1 (f) o Arrival time t2(f). Describe an efficient algorithm for
OR
OR