Breadth First Search

Estimated Time

1 hour

Learning Objectives of the Experiment

In this experiment, we will be able to do the following:

  • Study the basic concepts of Graphs and Queues and their representation.
  • Study the various Graph traversal algorithms and difference between them.
  • Understand the BFS Graph traversal using queues.
  • Demonstrate knowledge of time complexity and space complexity of performing a BFS on a given graph.