[REQUEST] Add DFS Traversal in Java

Algorithm Name

Depth First Search

Programming Language

Java

Category

Graph Algorithms

Difficulty Level

Easy (Beginner friendly)

Algorithm Description

DFS is widely used in a variety of computer science and real-world applications, including:

🔍 Pathfinding and Search Problems – such as finding connected components or paths in a graph.

🧠 Topological Sorting – for scheduling and dependency resolution.

🔄 Cycle Detection – to check if a graph contains cycles (in directed or undirected graphs).

🌐 Maze Solving & Game AI – for exploring possible moves or routes.

🌳 Tree Traversals – acts as a base for preorder, inorder, and postorder traversals in trees.

References (Optional)

No response

Contribution Intent

• I would like to implement this algorithm myself
• I'm requesting this for someone else to implement
• I need help implementing this algorithm

Code of Conduct

• #656