Depth First Search (DFS) in C, C++, Python and Java

[Kumar-laxmi]

Is your feature request related to a problem? Please describe. Depth First Traversal (or DFS) for a graph is similar to Depth First Traversal of a tree. The only catch here is, that, unlike trees, graphs may contain cycles (a node may be visited twice). To avoid processing a node more than once, use a boolean visited array. A graph can have more than one DFS traversal.

Describe the solution you'd like Depth-first search 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 case of a graph) and explores as far as possible along each branch before backtracking.

Additional context

[rayarka26]

Please assign me this issue

[OMKAR-KALEPU]

I'd like to work on this issue.

[mandliyarajendra11]

i want to work on this issue

[harshitaaa8]

i want to work on this issue.

[ShanmukhiKairuppala]

Can you please assign me this issue under ssoc'23 ?

[Vidip-Ghosh]

I would like to work on this issue. Can you please assign this to me under SSOC 2.0?

[marshadkhn]

Hey @Kumar-laxmi I would like to work on this issue as I am doing open-source and data structure and algorithm since 5month I can write this code in all the languages you mentioned with the optimized code and I have my new approach too

My branch name will be - marshadkhn Assign me this @Kumar-laxmi

[viveksingh912]

Hey @Kumar-laxmi
I would like to work on this issue. Can you please assign this to me under SSOC 2.0? .

[snehpr966]

Interested to solve

[ranjanmangla1]

Hey @Kumar-laxmi , i would love to work on this! Can you assign me this issue?

[Kumar-laxmi]

Assigned! @ShanmukhiKairuppala : C, C++, Python and Java

[neeraj542]

Dear @Kumar-laxmi,

I would like to contribute to your project on GitHub by implementing the Depth First Search (DFS) algorithm in C, C++, Python, and Java. I have reviewed the issue and devised a plan to tackle it effectively:

1. Understand the codebase.
2. Implement DFS in C, C++, Python, and Java.
3. Handle graph cycles using a visited array.
4. Test, debug, and ensure reliability.
5. Integrating the code.

With my experience in algorithm design and proficiency in these programming languages, I am confident in delivering a robust DFS solution. Please consider assigning this issue to me, and I will work diligently to enhance your project.

Thank you for considering my request, and I look forward to being a part of the SSoC'23 program while working on your project.

Best regards, Neeraj Meena

[Raksha703]

Hey, I am SSOC'23 contributor and would like to contribute to this issue. Please assign this issue to me!!

[jahnvisahni31]

Hey, I am SSOC'23 contributor and would like to contribute to this issue. Please assign this issue to me!!

[SimranLahrani842]

Is your feature request related to a problem? Please describe. Depth First Traversal (or DFS) for a graph is similar to Depth First Traversal of a tree. The only catch here is, that, unlike trees, graphs may contain cycles (a node may be visited twice). To avoid processing a node more than once, use a boolean visited array. A graph can have more than one DFS traversal.

Describe the solution you'd like Depth-first search 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 case of a graph) and explores as far as possible along each branch before backtracking.

Additional context

I was the first one to ask for DFS in issue #1503 .U closed it idk why...please assign me now in Java and python.

[NupurHardiya]

Hey @Kumar-laxmi I would like to work on this issue. Can you please assign this to me under SSOC 23 ? .

[github-actions[bot]]

Stale issue message