20.3.5. Formal Code for BFS

Try these first

1. 1.

   Define a graph and its components.

   Hint

   Think about how to represent things visually.

2. 2.

   What does BFS stand for?

   Hint

   It's a method of exploring graphs.

3. 3.

   What do the entries in an adjacency matrix represent?

   • Connection between vertices
   • Weights of edges
   • Vertices themselves

   Hint

   Consider the matrix structure.

4. 4.

   True or False: BFS is an algorithm used for Depth First Search.

   • True
   • False

   Hint

   Remember the 'B' in BFS.

5. 5.

   Given a graph represented as an adjacency list, implement the BFS algorithm and return the order of vertex traversal.

   Hint

   Think about how you can utilize queues efficiently.

6. 6.

   If a graph has multiple components, how can you modify BFS to check connectivity from a given vertex to all reachable vertices?

   Hint

   Consider what happens when not all vertices are connected.