2.4. Cost Considerations

Try these first

1. 1.

   What does each node represent in the air travel network?

   Hint

   Think about what cities you can fly to.

2. 2.

   What are edges in a graph?

   Hint

   Consider what links the cities together.

3. 3.

   What does a node represent in graph theory?

   • A flight
   • A city
   • A connection

   Hint

   Remember what each point on the map symbolizes.

4. 4.

   True or False: More cities (N) will always make an algorithm run faster.

   • True
   • False

   Hint

   Consider what happens when you have more connections.

5. 5.

   Given a network of cities with varying numbers of edges (flights), calculate how many unique paths exist from city A to city B if each edge can be traversed once.

   Hint

   Think about how you can explore branches without retracing your steps.

6. 6.

   Analyze the effects of adding two more flights between two existing cities in terms of algorithm efficiency. What changes will you observe?

   Hint

   Measure how added connections affect search complexity.