**Breadth First Search**

**Breadth First Search**

**BFS** stands for **Breadth First Search** is a vertex based technique for finding a shortest path in graph. It uses a Queue data structure which follows first in first out. In BFS, one vertex is selected at a time when it is visited and marked then its adjacent are visited and stored in the queue. It is slower than DFS.

**Ex-**

A / \ B C / / \ D E F

**Output is:**

A, B, C, D, E, F

**Depth First Search**

**Depth First Search**

**DFS** stands for **Depth First Search** is a edge based technique. It uses the Stack data structure, performs two stages, first visited vertices are pushed into stack and second if there is no vertices then visited vertices are popped.

**Ex-**

A / \ B C / / \ D E F

**Output is:**

A, B, D, C, E, F

**BFS vs DFS**

**BFS vs DFS**

S.NO | BFS | DFS |
---|---|---|

1. | BFS stands for Breadth First Search. | DFS stands for Depth First Search. |

2. | BFS(Breadth First Search) uses Queue data structure for finding the shortest path. | DFS(Depth First Search) uses Stack data structure. |

3. | BFS can be used to find single source shortest path in an unweighted graph, because in BFS, we reach a vertex with minimum number of edges from a source vertex. | In DFS, we might traverse through more edges to reach a destination vertex from a source. |

3. | BFS is more suitable for searching vertices which are closer to the given source. | DFS is more suitable when there are solutions away from source. |

4. | BFS considers all neighbors first and therefore not suitable for decision making trees used in games or puzzles. | DFS is more suitable for game or puzzle problems. We make a decision, then explore all paths through this decision. And if this decision leads to win situation, we stop. |

5. | The Time complexity of BFS is O(V + E) when Adjacency List is used and O(V^2) when Adjacency Matrix is used, where V stands for vertices and E stands for edges. | The Time complexity of DFS is also O(V + E) when Adjacency List is used and O(V^2) when Adjacency Matrix is used, where V stands for vertices and E stands for edges. |

Please also see BFS vs DFS for Binary Tree for the differences for a Binary Tree Traversal.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- BFS vs DFS for Binary Tree
- Difference between Local File System (LFS) and Distributed File System (DFS)
- Calculate number of nodes between two vertices in an acyclic Graph by DFS method
- Minimum number of edges between two vertices of a graph using DFS
- Breadth First Search or BFS for a Graph
- 0-1 BFS (Shortest Path in a Binary Weight Graph)
- BFS for Disconnected Graph
- Print all paths from a given source to a destination using BFS
- Traversing directory in Java using BFS
- BFS using STL for competitive coding
- Water Jug problem using BFS
- Diameter of n-ary tree using BFS
- Level of Each node in a Tree from source node (using BFS)
- Count the number of nodes at given level in a tree using BFS.
- BFS using vectors & queue as per the algorithm of CLRS
- Detect cycle in an undirected graph using BFS
- Detect Cycle in a Directed Graph using BFS
- Finding the path from one vertex to rest using BFS
- Print the lexicographically smallest BFS of the graph starting from 1
- Islands in a graph using BFS

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.