20.3.3. Pseudo Code for BFS

Try these first

1. 1.

   What does BFS stand for?

   Hint

   Think of how it explores graphs.

2. 2.

   Name one way to represent a graph.

   Hint

   Consider the structures used to show edges.

3. 3.

   What does BFS primarily explore?

   • Edges
   • Vertices
   • Weight of edges

   Hint

   Remember the structure of the algorithm.

4. 4.

   True or False: BFS can find paths in weighted graphs.

   • True
   • False

   Hint

   Think about how weights affect path choice.

5. 5.

   In a given graph, apply BFS starting from vertex A. What vertices are visited, and in what order?

   Hint

   Remember to only traverse to unvisited neighbors.

6. 6.

   Devise a modification to BFS that allows it to handle weighted graphs, ensuring all nodes are still reached while considering edge weights.

   Hint

   Consider how priorities change your exploration approach.