Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

DFS algorithm #75

Open
1 task done
Dark-Hope-tech opened this issue Oct 3, 2021 · 2 comments
Open
1 task done

DFS algorithm #75

Dark-Hope-tech opened this issue Oct 3, 2021 · 2 comments

Comments

@Dark-Hope-tech
Copy link

Description

Describe more about the issue.
The DFS algorithm is a recursive algorithm that uses the idea of backtracking. It involves exhaustive searches of all the nodes by going ahead, if possible, else by backtracking.

Here, the word backtrack means that when you are moving forward and there are no more nodes along the current path, you move backwards on the same path to find nodes to traverse. All the nodes will be visited on the current path till all the unvisited nodes have been traversed after which the next path will be selected.

Programming language

  • C++

Are you contributing under any open-source program ?
@Bhavesh-Rawat
Copy link

May, I Work On This Issue.

@Bhavesh-Rawat
Copy link

May I ?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@Dark-Hope-tech @Bhavesh-Rawat