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.

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

I have added some basic graph traversal algorithms. #399

Merged
merged 6 commits into from
Oct 7, 2022

Conversation

sandptel
Copy link
Contributor

@sandptel sandptel commented Oct 6, 2022

#391
Please check all that apply.

This PR is for:

  • Algorithm
  • Cheatsheet
  • Resource
  • Other

Title for the Algorithm/Cheat-Sheet/Resource: [Title here]

Programming Language: [Language here]

  • Have you implemented it on your local machine or any online compiler?
  • There is the main( ) function to run the program and all the inputs which are being taken are clearly printed on the console or well commented in the file.
  • Filename is self-explanatory or there is Readme.md file explaining the necessary details of the algorithm.

P.S. Failing to update the PR in 10 days on requested changes will be marked outdated and closed.

@sandptel
Copy link
Contributor Author

sandptel commented Oct 6, 2022

@starkblaze01 can you please merge it.

Copy link
Owner

@starkblaze01 starkblaze01 left a comment

Choose a reason for hiding this comment

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

Now this is something different, Glad to see not just a gfg plain algo, thanks for extra effort

@sandptel
Copy link
Contributor Author

sandptel commented Oct 7, 2022

Now this is something different, Glad to see not just a gfg plain algo, thanks for extra effort

Thank you @starkblaze01,I would like to add some more things later on about using those functions and a good readme.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants