The Baeldung logo
  • The Baeldung LogoCS Sublogo
  • Start Here
  • About ▼▲

    • Full Archive

      The high level overview of all the articles on the site.

    • About Baeldung

      About Baeldung.

Algorithms » DFS

Algorithms are one of the foundational concepts in programming.

We’re exploring the basics of Computer Science here, and a lot more here, on the Java side.

  • Array (34)
  • Metaheuristics (23)
  • Binary Tree (22)
  • Optimization (20)
  • Strings (14)
  • Dijkstra (14)
  • x DFS (12)
  • Geometry (12)
  • Dynamic Programming (12)
  • Natural Language Processing (11)
  • QuickSort (10)
  • BFS (9)
  • Merge Sort (9)
  • Probability and Statistics (8)
  • Hashing (8)
  • Linked List (8)
  • Heap (7)
  • NP-Complete (6)
  • Gameplay Algorithms (5)
  • Matrix (5)
  • Compression (4)
  • Heapsort (4)
  • Prim (4)
  • Cryptography (3)
  • Neural Networks (2)
  • Combinatorics (2)
  • Scheduling (2)
  • Image Processing (2)
  • Formal Languages (2)
  • Kruskal (2)
  • reference (2)
  • Acyclic Graphs (2)
  • Cyclic Graphs (2)

>> Network Flow: Dinic’s Algorithm

>> Backtracking vs. Depth-First Search

>> Depth-First Search vs. Breadth-First Search

>> The Informed vs. Uninformed Search Algorithms

>> Tracing the Path in DFS, BFS, and Dijkstra’s Algorithm

>> Iterative Deepening vs. Depth-First Search

>> Appointment Scheduling Algorithm

>> What Is the Time Complexity of Tree Traversal?

>> Introduction to Depth First Search Algorithm (DFS)

>> Reconstructing a Tree From Its Depth-First Traversals

>> Topological Sort of Directed Acyclic Graph

>> Methods of Depth First Traversal and Their Applications

  • ↑ Back to Top
The Baeldung logo

Categories

  • Algorithms
  • Artificial Intelligence
  • Core Concepts
  • Data Structures
  • Graph Theory
  • Latex
  • Networking
  • Security

Series

About

  • About Baeldung
  • The Full archive
  • Editors
  • Terms of Service
  • Privacy Policy
  • Company Info
  • Contact
The Baeldung Logo