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)
[x] This issue was assigned to me if not it will marked as spam.
[x] My file is in proper folder
[x] I am following clean code and Documentation.My code is well linted and I am using flake8 standard for python
[x] I have added title and what program will do first in the file
acknowledgment
[x] I have tested the script and distributed it under an MIT license.
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)
acknowledgment