# Breadth First Search (BFS) and Depth First Search (DFS) Algorithms

In this article, we learn about the **concept of Breadth first search (BFS) and depth first search (DFS)** and the **algorithms of breadth first search and the depth first search**.

Submitted by Shivangi Jain, on July 27, 2018

## 1) Breadth first search (BFS)

**Breadth first search** explores the space level by level only when there are no more states to be explored at a given level does the algorithm move on to the next level.

We implement **BFS** using lists open and closed to keep track of progress through the state space. In the order list, the elements will be those who have been generated but whose children have not been examined. The closed list records the states that have been examined and whose children have been generated. The order of removing the states from the open list will be the order of searching. The open is maintained as a queue on the first in first out data structure. States are added to the right of the list and removed from the left.

After initialization, each vertex is enqueued at most once and hence dequeued at most once. The operations of enqueuing and dequeuing take **O (1)** time, so the total time devoted to queue operations is **O (v)**. Because the adjacency list of each vertex is scanned only when the vertex is dequeued, the adjacency list of each vertex is scanned at most once. Since the sum of the lengths of all the adjacency lists is the ta(E), at most **O(E)** time is spent in total scanning adjacency lists. The overhead for the initialization is **O(v)**, and thus the total running time of **BFS** is **O(v+E)**. Thus, **breadth first search** runs in time linear in the size of the adjacency list representation.

### Algorithm - Breadth First Search (BFS)

1. Begin 2. Open = [start]; 3. Closed =[]; 4. While open != [] do 5. Begin 6. Remove leftmost state from open call it x; 7. If x is a goal then return success 8. Else 9. Begin 10. Generate children of x; 11. Put x on closed; 12. Put children on right end of open; 13. End 14. End 15. Return(failure) 16. End

## 2) Depth First Search (DFS)

In **depth first search**, when a state is examined all of its children and their descendants are examined before any of its siblings. **Depth first search** goes deeper into the search space whenever this is possible, only when no further descendants of a state can be found, are its siblings considered.

A **depth first** traversal takes **O(N*E)** time for adjacency list representation and **O(N2)** for matrix representation.

### Algorithm - Depth First Search (DFS)

1. Begin 2. Open = [start]; 3. Closed = []; 4. While open != [] do 5. Begin 6. Remove left most state from open call it x; 7. If x is a goal then return success 8. Else 9. Begin 10. Generate children of x; 11. Put x on closed; 12. Put children on left end of open; 13. End 14. End 15. Return (failure) 16. End

**References:**

- ELEMENTARY GRAPH ALGORITHMS
- CSci 231 Homework 10 Solutions
- Structure and strategy for complex problem solving
- Language, culture, computation

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.