20.2.1. Adjacency Matrix

Try these first

1. 1.

   Define an adjacency matrix.

   Hint

   Think about how we can visualize connections between vertices.

2. 2.

   What does BFS stand for?

   Hint

   Focus on how the algorithm explores vertices.

3. 3.

   What indicates the presence of an edge in an adjacency matrix?

   • 1
   • 0
   • Edges only

   Hint

   Think about how we mark connections in the matrix.

4. 4.

   True or False: Breadth-First Search can be used to find the longest path in a graph.

   • True
   • False

   Hint

   Remember what BFS accomplishes regarding paths.

5. 5.

   Given a complex graph with nodes and edges listed, create an adjacency matrix representation of this graph.

   Hint

   Carefully map each node's edges to the matrix.

6. 6.

   Implement BFS for a given adjacency matrix in pseudocode and explain how you would track the path taken.

   Hint

   Focus on how you enqueue nodes and mark their visited status.