GitHub - HxnDev/Solving-a-Maze-Using-BFS-and-DFS: Breadth-first search (BFS) is an algorithm for searching a tree data structure that searches the tree one depth at a time. It will explore all nodes at depth 1 then depth 2 and so on. Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followed by the next branch.

All the files have been commented for your ease. Furthermore you may also add further comments if you may.

For further queries contact me at : chhxnshah@gmail.com

Name		Name	Last commit message	Last commit date
LICENSE		LICENSE
Readme.md		Readme.md
Solving a Maze Using BFS and DFS .pdf		Solving a Maze Using BFS and DFS .pdf
main.py		main.py

Navigation Menu