20.2. Graph Representation

Try these first

1. 1.

   What is an adjacency matrix?

   Hint

   Think about how to represent data in a grid.

2. 2.

   What does BFS stand for?

   Hint

   Consider the order in which it explores.

3. 3.

   What is the primary use of an adjacency matrix?

   • To check for vertex connections
   • To represent edge weights
   • To enhance BFS performance

   Hint

   Think about its layout and what it shows.

4. 4.

   BFS stands for Back-First Search. True or False?

   • True
   • False

   Hint

   Recall the meaning of breadth in this context.

5. 5.

   Given a graph with 8 vertices and a sparse representation using an adjacency list, implement BFS and track the path taken.

   Hint

   Think about how each node connects and the queue's order.

6. 6.

   Explain the significance of using different graph representations for BFS performance based on graph density.

   Hint

   Consider how many edges exist in relation to vertices.