Difference Between DFS vs BFS In 2020

The major difference between in dfs vs bfs is that BFS continues level by level while DFS follows the first a path form the starting to the ending in node (vertex), then another path from the start to the end, and so on until all nodes are checked out. In addition, BFS uses the line for saving the nodes whereas DFS utilizes the stack for traversal of the nodes.

BFS and DFS are the passing through approaches utilized in searching a graph. Chart traversal is the process of checking out all the nodes of the chart. A graph is a group of the Vertices ‘V’ and Edges ‘E’ linking to the vertices.

Difference Between DFS vs BFS In 2020

In this article, you can know about dfs vs bfs here are the details below;

Comparison Chart

Basis for comparisonBFSDFS
BasicVertex-based algorithmEdge-based algorithm
Data structure used to store the nodesQueueStack
Memory consumptionInefficientEfficient
Structure of the constructed treeWide and shortNarrow and long
Traversing fashionOldest unvisited vertices are explored at first.Vertices along the edge are explored in the beginning.
OptimalityOptimal for finding the shortest distance, not in cost.Not optimal
ApplicationExamines bipartite graph, connected component and shortest path present in a graph.Examines two-edge connected graph, strongly connected graph, acyclic graph and topological order.


Definition of BFS

Breadth First Search dfs vs bfs is the traversing methods used in charts. It utilizes a line for saving the gone to vertices. In this methods the emphasize is on the vertices of the graph, one vertex is picked at first then it is checked out and marked. The vertices adjacent to the gone to vertex are then checked out and saved in the queue sequentially.

Similarly, the stored vertices are then is treated one by one, and their nearby vertices are checked out. A node is fully checked out before visiting any other node in the chart, in other words, it passes through shallowest undiscovered nodes first.


We have a chart whose vertices are A, B, C, D, E, F, G. Considering A as starting point. The actions involved in the process are:

  • – Vertex A is expanded and kept in the queue.
  • – Vertices B, D and G successors of the A, are expanded and storeds in the queue on the other hand Vertex A got rid of.
  • – Now B at the front size end of the line is eliminated along with saving its follower vertices E and F.
  • – Vertex D is at the fronts end of the line is eliminated, and its linked node F is currently checked out.
  • – Vertex G is removed from the line, and it has follower E which is currently gone to.
  • – Now E and F are eliminated from the line, and its successor vertex C is passed through and saved in the line.
  • – At last C is also removed from the line is empty which suggests we are done.
  • – The produced Output is– A, B, D, G, E, F, C.


BFS can be beneficial in finding whether the chart has connected elements or not. And also it can be used in identifying a bipartite graph.

A graph is bipartite when the chart vertices are parted into two disjoint sets; no 2 surrounding vertices would live in the very same set. Another method dfs vs bfs of checking a bipartite chart is to check the event of an odd cycle in the graph. A bipartite graph should not include odd cycle.

BFS is likewise much better at finding the quickest course in the graph could be seen as a network.

Definition of DFS

Depth First Search dfs vs bfs traversing approach uses the stack for storing the checked out vertices. DFS is the edge based technique and works in the recursive style where the vertices are exploreds along with path (edge). The exploration of a nodes is suspended as soon as another unexplored node is discovered and the inmost uncharted nodes are passed through at primary. DFS traverse/visit each vertex precisely when and each edge is inspected exactly two times.


Comparable to BFS lets take the exact same chart for carrying out DFS operations, and the involved steps are:

  • – Considering A as the beginning vertex which is checked out and kept in the stack.
  • – B successor vertex of A is kept in the stack.
  • – Vertex B have 2 successors E and F, amongst them alphabetically E is checked out first and kept in the stack.
  • – The successor of vertex E, i.e., G is storeds in the stack.
  • – Vertex G have two connecteds vertices, and both are currently visited, so G is popped out from the stack.
  • – Similarly, E s likewise removed.
  • – Now, vertex B is at the top of the stack, its another node( vertex) F is exploreds and kept in the stack.
  • – Vertex F has 2 successor C and D, between them C is traversed initially and kept in the stack.
  • – Vertex C only have one the predecessor which is currently visited, so it is removed from the stack.
  • – Now vertex D connected to F is gone to and saved in the stack.
  • – As vertex D does not have any unvisited nodes, for that reason D is eliminated.
  • – Similarly, F, B and A are also popped.
  • – The produced output is– A, B, E, G, F, C, D.


The applications of DFS includes the inspection of 2 edge connected chart, highly linked chart, acyclic graph, and topological order.

A chart is called two edges linked if and only if it remains connected even if one of its edges is eliminated. This application is very beneficial, in computer networks dfs vs bfs where the failure of one link in the network will not impact the staying network, and it would be still linked.

Highly linked chart is a chart in which there needs to exist a path between bought set of vertices. DFS is utilized in the directed chart for searching the path in between every purchased set of vertices. DFS can easily resolve connection problems.

Key Differences Between Dfs Vs Bfs

  1. BFS is vertex-based algorithm while DFS is an edge-based algorithm.
  2. Line data structure is used in BFS. On the other hand, DFS utilizes stack or recursion.
  3. Memory space is efficiently made use of in DFS while area utilization in BFS is ineffective.
  4. BFS is ideal algorithm while DFS is not optimal.
  5. DFS constructs narrow and long trees. As against, BFS constructs broad and short tree.


BFS and DFS, both of the chart searching techniques have comparable running time but various area intake, dfs vs bfs takes linear space due to the fact that we have to keep in mind single course with unexplored nodes, while BFS keeps every node in memory.

DFS yields much deeper solutions and is not ideal, however it works well when the option is thick whereas BFS is optimal which browses the optimum goal in the beginning.

Check out over other articles like:

Related Articles

Back to top button