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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FSolving-a-Maze-Using-BFS-and-DFS
PURL: pkg:github/HxnDev/Solving-a-Maze-Using-BFS-and-DFS
Stars: 4
Forks: 0
Open issues: 0
License: mit
Language: Python
Size: 570 KB
Dependencies parsed at: Pending
Created at: almost 4 years ago
Updated at: 4 months ago
Pushed at: almost 4 years ago
Last synced at: 3 months ago
Topics: bfs, bfs-algorithm, bfs-search, code, dfs, dfs-algorithm, dfs-search, maze, maze-solver, python