Skip to content
This repository was archived by the owner on Jun 2, 2024. It is now read-only.

Conversation

oxBinaryBrain
Copy link
Contributor

@oxBinaryBrain oxBinaryBrain commented Mar 25, 2024

Pull Request Template

Created a folder named BFS algoritm under java algorithms and added an BFS algorithm folder and added the algorithm

Write here what you have changed in codebase
I have added a 'Breadth-first searching algorithm under the java/algorithms folder with a proper executable code.
BFS is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node for a graph) and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

Issue no.(must) - #958

Self Check(Tick After Making pull Request)

  • This issue was assigned to me if not it will marked as spam.
  • My file is in proper folder
  • I am following clean code and Documentation.My code is well linted and I am using flake8 standard for python
  • I have added title and what program will do first in the file

acknowledgment

  • I have tested the script and distributed it under an MIT license.

@oxBinaryBrain oxBinaryBrain changed the title Created a f Created a folder named BFS under java/algorithm and added a Breadth-first searching algorithm( #issue - 958) Mar 25, 2024
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant