19.1.4. Finding Paths

Try these first

1. 1.

   What is a graph?

   Hint

   Think of it as a network of points.

2. 2.

   Define an adjacency matrix.

   Hint

   Consider its structure—how it relates to rows and columns.

3. 3.

   Which of the following represents a graph structure?

   • Vertices and paths
   • Numbers and letters
   • Colors and shapes

   Hint

   Think about what components form a graph.

4. 4.

   True or False: An adjacency matrix is always symmetric in an undirected graph.

   • True
   • False

   Hint

   Remember the nature of undirected connections.

5. 5.

   You have a directed graph representing a traffic system with vertices as intersections. Describe how you would determine the fastest route to a destination using BFS.

   Hint

   Think about how you can avoid going back to intersections you've already checked.

6. 6.

   Create a real-world scenario where using a depth-first search could yield beneficial results over breadth-first search, explaining your reasoning.

   Hint

   Consider scenarios where delving deep is more advantageous.