/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.

Primary LanguagePythonMIT LicenseMIT

Stargazers