Breadth-First Search

The content here is from Introduction to Algorithm by CLRS, with a bit more detailed explanation. This book is called the “Bible of Algorithms”, that is, the best book to learn nearly all about algorithms. If you plan on continuing your education in Programming/Theoretical Computing, I would strongly suggest that you buy a copy for yourself. Buy it here or scroll down for more book suggestions.

Please check the challenges section at the end of the article. If you are interested in taking up any one of them, I can help you get started.

Since the article is a bit long, I have split it into pages – scroll down and click the next page number to continue reading.


  1. Contents
  2. Introduction
  3. Prerequisites
  4. Algorithm
  5. Description
  6. Sample Execution
  7. Loop Invariant
  8. Simple Implementation of BFS in Python
  9. Other Ways to See Algorithm in Action
  10. Some Applications
  11. Challenges
  12. Queue Operations: Algorithms
  13. Extra Links

This article will be further developed with theorems and their proofs soon, as I get time!

Pages: ContentsNext Page >>

Graph Algorithms: Book Suggestions

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.