Depth-first search (DFS) is an algorithm (or technique) for traversing a graph.
Following are the problems that use DFS as a building block.
1) For a weighted graph, DFS traversal of the graph produces the minimum spanning tree and all pair shortest path tree.
2) Detecting cycle in a graph
A graph has cycle if and only if we see a back edge during DFS. So we can run DFS for the graph and check for back edges. (See this for details)
3) Path Finding
We can specialize the DFS algorithm to find a path between two given vertices u and z.
i) Call DFS(G, u) with u as the start vertex.
ii) Use a stack S to keep track of the path between the start vertex and the current vertex.
iii) As soon as destination vertex z is encountered, return the path as the
contents of the stack
See this for details.
4) Topological Sorting
Topological Sorting is mainly used for scheduling jobs from the given dependencies among jobs. In computer science, applications of this type arise in instruction scheduling, ordering of formula cell evaluation when recomputing formula values in spreadsheets, logic synthesis, determining the order of compilation tasks to perform in makefiles, data serialization, and resolving symbol dependencies in linkers .
5) To test if a graph is bipartite
We can augment either BFS or DFS when we first discover a new vertex, color it opposited its parents, and for each other edge, check it doesn’t link two vertices of the same color. The first vertex in any connected component can be red or black! See this for details.
6) Finding Strongly Connected Components of a graph A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex. (See this for DFS based algo for finding Strongly Connected Components)
7) Solving puzzles with only one solution, such as mazes. (DFS can be adapted to find all solutions to a maze by only including nodes on the current path in the visited set.)
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Depth First Search or DFS for a Graph
- Top 10 Interview Questions on Depth First Search (DFS)
- Iterative Deepening Search(IDS) or Iterative Deepening Depth First Search(IDDFS)
- Iterative Depth First Traversal of Graph
- Sum of minimum element at each depth of a given non cyclic graph
- Minimum valued node having maximum depth in an N-ary Tree
- Flatten a multi-level linked list | Set 2 (Depth wise)
- Applications of Breadth First Traversal
- Graph Types and Applications
- Graph Coloring | Set 1 (Introduction and Applications)
- Applications of Graph Data Structure
- Applications of Minimum Spanning Tree Problem
- Karger’s algorithm for Minimum Cut | Set 2 (Analysis and Applications)
- Best First Search (Informed Search)
- Bidirectional Search
- Breadth First Search or BFS for a Graph
- Breadth First Search without using Queue
- Implementing Water Supply Problem using Breadth First Search
- Uniform-Cost Search (Dijkstra for large Graphs)
- Finding minimum vertex cover size of a graph using binary search