20.3.2. Data Structures for BFS

Try these first

1. 1.

   What does an adjacency matrix represent?

   Hint

   Think about how vertices are arranged in a grid.

2. 2.

   What is the role of the visited array in BFS?

   Hint

   Consider why we don’t want to revisit vertices.

3. 3.

   What does BFS stand for?

   • Binary First Search
   • Breadth First Search
   • Normal First Search

   Hint

   Focus on the term 'breadth' when thinking about exploration.

4. 4.

   True or False: BFS can be used to find the shortest path in an unweighted graph.

   • True
   • False

   Hint

   Consider the meaning of 'shortest path' in this context.

5. 5.

   Given a graph represented as an adjacency list, outline how you would implement BFS in Python, including edge cases.

   Hint

   Think about how to handle special cases like isolated vertices.

6. 6.

   Explain how you would modify the BFS algorithm to find the longest path in an unweighted graph.

   Hint

   Consider the inverse nature of finding longest as opposed to shortest.