2.1.1. Modeling the Network

Try these first

1. 1.

   What do we call the connections between the cities in a graph?

   Hint

   Think about how roads connect different places.

2. 2.

   What is the term for the points (cities) in a graph?

   Hint

   These are like the locations on a map.

3. 3.

   What is a graph?

   • A mathematical representation with nodes and edges
   • A type of airline ticket
   • A flight route
   • A map of cities

   Hint

   Think about how cities can be connected.

4. 4.

   True or False: A planar graph has edges that cross each other.

   • True
   • False

   Hint

   Consider what makes a graph planar.

5. 5.

   Given a graph with N nodes and directed edges, how would you find if two specific nodes are connected in the least number of steps? Discuss potential methods and their complexities.

   Hint

   Remember that BFS explores connections one layer at a time.

6. 6.

   Suppose a new airline introduces additional flights between several cities. Analyze how this affects the overall connectivity of the network. What considerations should be made?

   Hint

   Think about how more connections can create more direct routes.