https://github.com/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.
https://github.com/hxndev/solving-a-maze-using-bfs-and-dfs
bfs bfs-algorithm bfs-search code dfs dfs-algorithm dfs-search maze maze-solver python
Last synced: 3 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/hxndev/solving-a-maze-using-bfs-and-dfs
- Owner: HxnDev
- License: mit
- Created: 2021-07-19T11:09:47.000Z (almost 4 years ago)
- Default Branch: main
- Last Pushed: 2021-07-19T11:24:51.000Z (almost 4 years ago)
- Last Synced: 2023-03-04T18:38:14.092Z (over 2 years ago)
- Topics: bfs, bfs-algorithm, bfs-search, code, dfs, dfs-algorithm, dfs-search, maze, maze-solver, python
- Language: Python
- Homepage:
- Size: 570 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0