Depth First Search
Last updated
What is Depth First Search?
Depth First Search (DFS) is an algorithm for traversing or searching tree or graph data structures. The process starts at the root (in the case of a tree) or an arbitrary node (in case of a graph), and explores as far as possible along each branch before retracing steps. Essentially, DFS is about diving deep into the tree/graph from a starting point, and when no more nodes are left to explore, it backtracks, moving up the tree/graph. This repeat until all nodes have been visited. This algorithm is often used in simulation of game states, solving puzzles and finding connected components in a graph.
More in stage 11: Advanced Data Structures
- Advanced Data Structures
- Trie
- Segment Trees
- Fenwick Trees
- Disjoint Set (Union-Find)
- Suffix Trees and Arrays
- Binary Trees
- Tree Traversal
- Search Algorithms
- Binary Search Trees
- In-Order Traversal
- Breadth First Search
- AVL Trees
- Pre-Order Traversal
- B-Trees
- Heap
- Post-Order Traversal
- Search Algorithms
- Breadth First Search
- Depth First Search
- Shortest Path Algorithms
- Dijkstra's Algorithm
- Bellman-Ford Algoritm
- A* Algorithm
- Minimum Spanning Tree
- Prim's Algorithm
- Kruskal's Algorithm
Depth First Search: common questions
Can I learn Depth First Search in Hindi?
This lesson is written in English. Once you sign in, open it in the interactive course and ask the AI tutor to explain Depth First Search in Hindi or Hinglish. The tutor answers from this lesson’s own text, so it stays on the syllabus, and it runs on your own Google, OpenAI or Anthropic key.
Is this Depth First Search tutorial for beginners?
It is lesson 66 of 107 in the free Data Structures & Algorithms roadmap, in stage 11, Advanced Data Structures. If you are new to Data Structures & Algorithms, start from stage 1 and come back here in order; if you already know the earlier stages, this lesson stands on its own.