2.3. Constraints in Flight Connections

Try these first

1. 1.

   Define what a graph is in the context of flight connections.

   Hint

   Think about how cities and flights relate to each other.

2. 2.

   What is a directed edge?

   Hint

   Consider the direction of flights.

3. 3.

   What is the representation of a flight network called?

   • Graph
   • Table
   • Model

   Hint

   Recall the terminology used in our discussions.

4. 4.

   True or False: A directed edge allows travel in both directions.

   • True
   • False

   Hint

   Think back to the definition of directed edges.

5. 5.

   Given a network of cities with varying flight connections, devise a comprehensive algorithm that considers time, cost, and availability of direct flights. Detail your algorithm's steps.

   Hint

   Consider how multiple layers of constraints can affect your route computations.

6. 6.

   Analyze how the maintenance of aircraft can impact the overall connectivity of a flight network. Propose a method to maintain minimum disruption during such periods.

   Hint

   Think about how each flight connects to others and which routes are vital.