18.2.4. Airline Routing as a Graph Problem

Try these first

1. 1.

   Define a graph in your own words.

   Hint

   Think about how cities connect in a network.

2. 2.

   What is a vertex?

   Hint

   It represents an entity, like a city.

3. 3.

   What does a vertex represent in a graph?

   • A flight
   • A city
   • A route

   Hint

   Think about what points in a graph symbolize.

4. 4.

   In a directed graph, if there's an edge from A to B, does it imply that there's an edge from B to A?

   • True
   • False

   Hint

   Consider the direction of flights.

5. 5.

   Given a directed graph of 6 cities with specified flights, determine if a direct route exists between two cities. If not, find the nearest connected cities.

   Hint

   Look for connections through intermediate cities.

6. 6.

   Create a directed graph representing your local area (cities and routes) and determine the shortest path between two selected cities.

   Hint

   Consider using Dijkstra's algorithm for shortest paths.