{"id":26875246,"url":"https://github.com/hxndev/solving-a-maze-using-bfs-and-dfs","last_synced_at":"2025-03-31T10:39:31.429Z","repository":{"id":107914711,"uuid":"387435863","full_name":"HxnDev/Solving-a-Maze-Using-BFS-and-DFS","owner":"HxnDev","description":"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.","archived":false,"fork":false,"pushed_at":"2021-07-19T11:24:51.000Z","size":584,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2023-03-04T18:38:14.092Z","etag":null,"topics":["bfs","bfs-algorithm","bfs-search","code","dfs","dfs-algorithm","dfs-search","maze","maze-solver","python"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/HxnDev.png","metadata":{},"created_at":"2021-07-19T11:09:47.000Z","updated_at":"2022-05-30T18:16:16.000Z","dependencies_parsed_at":null,"dependency_job_id":"f2a360f2-eda6-420c-b2ee-e428a808cd0f","html_url":"https://github.com/HxnDev/Solving-a-Maze-Using-BFS-and-DFS","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FSolving-a-Maze-Using-BFS-and-DFS","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FSolving-a-Maze-Using-BFS-and-DFS/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FSolving-a-Maze-Using-BFS-and-DFS/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FSolving-a-Maze-Using-BFS-and-DFS/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HxnDev","download_url":"https://codeload.github.com/HxnDev/Solving-a-Maze-Using-BFS-and-DFS/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246457264,"owners_count":20780666,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["bfs","bfs-algorithm","bfs-search","code","dfs","dfs-algorithm","dfs-search","maze","maze-solver","python"],"created_at":"2025-03-31T10:39:30.873Z","updated_at":"2025-03-31T10:39:31.402Z","avatar_url":"https://github.com/HxnDev.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":null,"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhxndev%2Fsolving-a-maze-using-bfs-and-dfs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhxndev%2Fsolving-a-maze-using-bfs-and-dfs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhxndev%2Fsolving-a-maze-using-bfs-and-dfs/lists"}