2.3.1. Timing Constraints

Try these first

1. 1.

   Define what a graph is in your own words.

   Hint

   Think about how cities and flights relate.

2. 2.

   What are nodes in the context of an airline network?

   Hint

   Consider what each point on a route map represents.

3. 3.

   What is a graph in the context of an airline network?

   • A flight schedule
   • A representation of cities and flights
   • A ticket booking system

   Hint

   Think about the structure we use to represent travel options.

4. 4.

   True or False: A directed edge means the flight can be taken in both directions.

   • True
   • False

   Hint

   Remember our discussion on how flights work.

5. 5.

   Consider a graph where the number of cities (N) and direct flights (F) quadruples. How would you approach recalculating the path from city A to city B, and what factors would you account for?

   Hint

   Think about how many more pathways you'll have to check and the efficiency of your chosen algorithm.

6. 6.

   If given a choice to minimize both time and cost for a flight path between two cities, how would you structure your algorithm to find the most feasible route?

   Hint

   Consider the tradeoffs in your algorithm and how they impact your outputs.