Add Depth-First Search (DFS) algorithm implementation #[HACTOBERFEST 2025]#151
Merged
siriak merged 2 commits intoTheAlgorithms:masterfrom Oct 5, 2025
Merged
Conversation
- Implement both recursive and iterative versions of DFS - Include comprehensive documentation with time and space complexity - Add extensive examples including cyclic graphs - Create new graph_algorithms directory - Update DIRECTORY.md to include the new algorithm
piyushkumar0707
requested review from
Panquesito7,
acylam,
eshom and
siriak
as code owners
There was a problem hiding this comment.
Pull Request Overview
Adds a new Depth-First Search (DFS) implementation (recursive and iterative) under a newly introduced Graph Algorithms section and updates DIRECTORY.md to reference it (along with several other added directory entries). Key changes:
- Adds graph_algorithms/depth_first_search.r with recursive and iterative DFS plus inline demo code.
- Updates DIRECTORY.md to include a new Graph Algorithms section and link to the DFS implementation.
Reviewed Changes
Copilot reviewed 2 out of 2 changed files in this pull request and generated 4 comments.
| File | Description |
|---|---|
| graph_algorithms/depth_first_search.r | Introduces DFS (recursive + iterative) plus example executions. |
| DIRECTORY.md | Adds Graph Algorithms section and entry for DFS (plus additional directory links). |
Tip: Customize your code reviews with copilot-instructions.md. Create the file or learn how to get started.
Member
|
Please check the comments |
Contributor
Author
|
@siriak sir i had resolved all conflicts now. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Overview
This PR adds a comprehensive implementation of the Depth-First Search (DFS) algorithm, creating a new Graph Algorithms category for the repository.
Features
Why This Matters
Graph algorithms are fundamental in computer science but were completely missing from this repository. DFS is one of the most important graph traversal algorithms used in:
Testing
The implementation includes multiple test cases with different graph structures including cyclic graphs.