DFS (Depth First Search) is a technique used for traversing trees or graphs. In this traversal first, the deepest node is visited and then backtracks to its parent node if no sibling of that node exists.
DFS is commonly used to solve various graph-related problems, such as finding connected components, topological sorting, and solving mazes.
Concept of Depth First Search
Step 1: Traverse the root node.
Step 2: Traverse any neighbour of the root node.
Step 3: Traverse any neighbour of neighbour of the root node.
Step 4: This process will continue until we are getting the goal node.
Algorithm of DFS
Step 1: PUSH the starting node into the stack.
Step 2: If the stack is empty then stop and return failure.
Step 3: If the top node of the stack is the goal node, then stop and return success.
Step 4: Else POP the top node from the stack and process it. Find all its neighbours that are in ready stateand PUSH them into the stack in any order.
Step 5: Go to step 3.
Step 6: Exit
Advantages of DFS
- DFS consumes very less memory space.
- It will reach at the goal node in a less time period than BFS if it traverses in a right path.
- It may find a solution without examining much of search because we may get the desired solution in the very first go.
Disadvantages of DFS
It is possible that may states keep reoccurring. There is no guarantee of finding the goal node.
Sometimes the states may also enter into infinite loops.
Application of DFS Algorithm
- For finding the path
- To test if the graph is bipartite
- For finding the strongly connected components of a graph
- For detecting cycles in a graph