[Feature Request]: Adding DFS algorithm to Graph Algorithms

[Santhosh-Siddhardha]

Is there an existing issue for this?

• [X] I have searched the existing issues

Feature Description

Depth-First Search (DFS) is another fundamental graph traversal algorithm that explores as far as possible along each branch before backtracking. It uses a stack data structure, either implicitly through recursion or explicitly.

Use Case

Pathfinding: DFS can be used to find a path between two nodes in a graph, which is useful in scenarios like network routing protocols. Topological Sorting: DFS is essential for topological sorting in directed acyclic graphs (DAGs), which is crucial for scheduling tasks in order of dependencies. Cycle Detection: DFS can detect cycles in a graph, which is useful in deadlock detection in operating systems.

Benefits

No response

Add ScreenShots

No response

Priority

High

Record

• [X] I have read the Contributing Guidelines
• [X] I'm a GSSOC'24 contributor
• [X] I have starred the repository

[github-actions[bot]]

Hi @Santhosh-Siddhardha! Thanks for opening this issue. We appreciate your contribution to this open-source project. Your input is valuable and we aim to respond or assign your issue as soon as possible. Thanks again!

[github-actions[bot]]

Hello @Santhosh-Siddhardha! Your issue #2847 has been closed. Thank you for your contribution!