Algo_ds_101: DFS

Created on 2 Oct 2020  路  8Comments  路  Source: ahampriyanshu/algo_ds_101

Submission Title
DFS

Submission Type
Algorithm

Submission Description
DFS starts with a root node or a start node and then explores the adjacent nodes of the current node by going deeper into the graph or a tree.

Contributors

  • [x] C++ -
  • [x] C -
  • [x] Python -
  • [x] Java -
  • [x] JavaScript -
  • [ ] TypeScript -
  • [ ] Golang -
  • [ ] Ruby -
  • [ ] Scala -
C++ Hacktoberfest New Submssion TypeScript first timer good first issue java ruby scala
Source
picture ahampriyanshu

All 8 comments

I've great experience in writing clean and readable code, so I would like to work on this issue.
Can you please assign it to me?
I can work on Python, C and Java

rahulsunil2 picture rahulsunil2 on 2 Oct 2020
👍1

Can i work on this in c++?

ankur-kayal picture ankur-kayal on 2 Oct 2020
👍1

I would like to contribute in C++. Please assign it to me

shivamkumar123 picture shivamkumar123 on 2 Oct 2020

I would like to contribute in javascript, may I've it assigned

alekz7 picture alekz7 on 2 Oct 2020
👍1

@shivamkumar123 I have already assigned @ankur-kayal in C++
Please opt a different language or issue :grin:

ahampriyanshu picture ahampriyanshu on 2 Oct 2020
👍1

Can I contribute to this in Python?

OfiliPatrick picture OfiliPatrick on 2 Oct 2020
👍1

@shivamkumar123 go ahead with C++
@OfiliPatrick go ahead with Python

ahampriyanshu picture ahampriyanshu on 3 Oct 2020
👍1

thanks @everyone :v:

ahampriyanshu picture ahampriyanshu on 4 Oct 2020
Was this page helpful?
0 / 5 - 0 ratings

Related issues

Sushantrimurti picture Sushantrimurti  路  5Comments
Jaswantsinghh picture Jaswantsinghh  路  5Comments
aakashsoni-cloud picture aakashsoni-cloud  路  3Comments
ahampriyanshu picture ahampriyanshu  路  5Comments
ahampriyanshu picture ahampriyanshu  路  5Comments