2.2.2. Dependency on N and F

Try these first

1. 1.

   What do we call the structure made of nodes and edges?

   Hint

   Think about how we represent cities and flights.

2. 2.

   If N represents cities, what does F represent?

   Hint

   Focus on direct connections between cities.

3. 3.

   What represents cities in graph theory?

   • Edges
   • Nodes
   • Connections

   Hint

   Think about the structure of the graph.

4. 4.

   True or False: The number of flights does not impact algorithm efficiency.

   • True
   • False

   Hint

   Evaluate how connections affect pathfinding.

5. 5.

   Create a graph from a list of cities and their connecting flights. Analyze the graph for possible paths and describe the algorithm you would use to find the shortest path.

   Hint

   Remember to consider both path costs and distances.

6. 6.

   Imagine a scenario where an airline has to reduce flights due to maintenance, affecting the connectivity of the network. How would you assess the impact, and what strategy would you propose to maintain network effectiveness?

   Hint

   Consider redundancy and essential flight paths.