About 807,000 results
Open links in new tab
  1. Depth First Search or DFS for a Graph - GeeksforGeeks

    Oct 25, 2025 · Depth First Search (DFS) is a graph traversal method that starts from a source vertex and explores each path completely before backtracking and exploring other paths. To …

  2. Depth-first search - Wikipedia

    Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the …

  3. Depth First Search (DFS) Algorithm - Programiz

    In this tutorial, you will learn about the depth-first search with examples in Java, C, Python, and C++.

  4. Depth-First Search (DFS) Algorithm Explained - Codecademy

    Learn Depth-First Search (DFS) algorithm with step-by-step explanations, pseudocode, and Python examples in this complete, beginner-friendly guide.

  5. Depth First Search (DFS) – Iterative and Recursive Implementation

    Sep 19, 2025 · Depth–first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root for a graph) …

  6. Depth First Search (DFS) Algorithm - Online Tutorials Library

    Depth First Search (DFS) algorithm is a recursive algorithm for searching all the vertices of a graph or tree data structure. This algorithm traverses a graph in a depthward motion and uses …

  7. Depth-First Search (DFS) | Brilliant Math & Science Wiki

    Depth-first search (DFS) is an algorithm for searching a graph or tree data structure. The algorithm starts at the root (top) node of a tree and goes as far as it can down a given branch …

  8. In this chapter, we focus on a particular instantiation of this algorithm calleddepth-first search, and primarily on the behavior of this algorithm in directed graphs.

  9. Depth First Search ( DFS ) Algorithm - Algotree

    DFS is an algorithm for traversing a Graph or a Tree. DFS starts with the root node and explores all the nodes along the depth of the selected path before backtracking to explore the next path.

  10. Learn Depth-First Search (DFS) Algorithm From Scratch

    Jan 25, 2025 · Learn what is DFS (Depth-First Search) algorithm and its examples. Explore its complexity, pseudocode, applications and code implementation of DFS. Start learning now!