# What is the difference between DFS and BFS?

## What is BFS?

BFS is generally known as the low level traversal. As we already know that it stands for breadth first search and is mainly used in the queue data structure. In this, we generally take up any node as the root node. It is generally a graph traversal algorithm that begins negotiating the graph from the initial node and inspects all the other nodes as well. After this, it chooses a node which is the closest and then traverses all the other unvisited nodes. When we use Breadth first search algorithm, we can easily use any node and consider them as the root node. There appears to be a lot of other methods as well to approach the graph for the traversal but BFS is known to be the most commonly used. It is generally categorized as a recursive algorithm which implies that it repeats itself. This algorithm is used to find all the vertices and nodes of a tree or graph data structure. This algorithm mainly categorizes a graph into two sub categories that are visited and non-visited. It chooses a single node from anywhere in the graph and then explores all the other adjacent nodes beside the chosen node. The BFS algorithm for a graph is nearly similar to that of a tree with the only difference that a graph might contain cycles in them. In this kind of algorithm, all the adjacent nodes are inquired before moving to the next level. It is based on the mechanism of adding adjacent nodes to the traversal line beginning from the initial node.

## What is DFS?

DFS stands for Depth First Search. Generally, it is a repetitive or decidable type of algorithm which is basically used in identifying all the vertices or nodes of a graph or tree data structure. It begins its hunt from the initial node in the graph G and hunts deeper and deeper until it reaches its goal which is also known as the goal node or the node that has no children. Due to its repetitive or to be more precise recursive behavior, the stack data structure is used in order to implement the DFS algorithm.

The stack data structure is generally used for this kind of traversal. The stack data structure works on the LIFO principle. LIFO stands for ‘Last In First Out’. In this type of algorithm, we can generally begin from any given node or anywhere unless and until the root node is mentioned in the problem. We can consider any node as the root node.

The major differences between DFS and BFS