4 Consider The Following Directed Multi Graph See Page 3 Each Edge Here Represents A Flight And Is Annotated With 1 (66.32 KiB) Viewed 75 times
4. Consider the following directed (multi) graph (see page 3). Each edge here represents a flight and is annotated with (departure time, arrival time). If we leave from airport A at 8am what is the soonest one can reach airport F. Please find this itinerary. You will use modified dijkstra's algorithm for this. The interpretation of d-value d(v) in this case will be that earliest time (based on so far what we know) we can reach the airport v.
(12,18) (17,20) b e ID (7,10) (14,19) (19,22) (9,13) (11,14) f f (14,17) a (18,21) (16,17) (18,21) (12,14) (8,10) (15,19) (12,16) С d (14,18)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!