Skip to content

Added BFS and DFS (graph algorithms) #408

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
Merged
merged 2 commits into from
Feb 11, 2019
Merged

Added BFS and DFS (graph algorithms) #408

merged 2 commits into from
Feb 11, 2019

Conversation

kHarshit
Copy link
Contributor

@kHarshit kHarshit commented Oct 3, 2018

No description provided.

poyea
poyea reviewed Feb 11, 2019
View reviewed changes
Copy link
Member

@poyea poyea left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks, will merge this soon.

@poyea poyea merged commit 1cbbd5f into TheAlgorithms:master Feb 11, 2019
@PandaWhoCodes
Copy link

What is the expected output?
I am getting a wrong output with this implementation.

@poyea
Copy link
Member

poyea commented Mar 21, 2019 •
edited
Loading

The algorithms return their explored sets. Outputs are not really specified.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@poyea poyea poyea approved these changes

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
3 participants
@kHarshit @PandaWhoCodes @poyea