2.3.2. Additional Considerations

Try these first

1. 1.

   Define what a node is in the context of a graph.

   Hint

   Think of a city represented in a mapping tool.

2. 2.

   What does an edge represent in a graph?

   Hint

   Consider how flights connect different locations directly.

3. 3.

   What does a node represent in a graph?

   • A city
   • A flight
   • An algorithm

   Hint

   Think about what you would plot on a map.

4. 4.

   True or False: The complexity of an algorithm increases as the number of direct flights increases.

   • True
   • False

   Hint

   Consider a busy airport with many flights.

5. 5.

   Design an algorithm to determine if there is a feasible route from city A to city B taking into consideration both the available flights and constraints such as layover time and overall journey cost.

   Hint

   Think about how you might prioritize which connections to use based on a combination of criteria.

6. 6.

   Given a non-planar graph representing multiple airlines with overlapping routes, analyze how different algorithms might handle route discovery differently compared to planar graphs.

   Hint

   What strategies can you employ to reduce complexity in overlapping or intersecting routes?