Thank you to the comments on #3632

I see there are already 4 BFS implementations in the graphs folder. Is this significantly different from those? Not sure, a maintainer would have to look over.

Oh my god I did not even see that folder, I just went off the comment under the issue I posted (#3260) that said to put it in searches and nobody else replied to that issue so I just went with it.

For a maintainer to decide then, looking at the other breadth first search algorithms though, it looks like they have to be fed a specific linked list, whereas mine generates a simple maze(optional) where the user only has to specify size, starting and ending location and it will print it the maze before and after it is solved. I could do the same for a different algorithm though it looks like most are covered in that graphs folder. Again, my bad, thought it would be in the searches folder

@Rolv-Apneseth Ah don't feel bad, the repo is not perfectly organized and contains a lot of redundant stuff. (We actually need people to improve existing files much more than we need new algorithms being submitted, at least in my opinion. Take a look at #2128 )

But as you can see it definitely pays to browse through the repo FIRST.

I guess mazes can be converted to graphs and vice versa, but your maze version might be worth having. But I guess it will take a long time to be reviewed.

There are other much much less popular TheAlgorithms repos where you could submit this: F#, Haskell, OCaml, Scala, Elm and so on. In the spirit of Hacktoberfest, learn a new language!

This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

Please reopen this pull request once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!