{"id":21842952,"url":"https://github.com/hazeliscoding/bfs-dfs-traveling","last_synced_at":"2026-05-15T23:35:14.462Z","repository":{"id":137631879,"uuid":"183107911","full_name":"hazeliscoding/bfs-dfs-traveling","owner":"hazeliscoding","description":"A demo of BFS and DFS pathfinding on a unweighted, undirected graph.","archived":false,"fork":false,"pushed_at":"2019-05-18T19:07:39.000Z","size":119,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-15T06:52:12.955Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hazeliscoding.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2019-04-23T22:59:58.000Z","updated_at":"2020-10-06T16:19:19.000Z","dependencies_parsed_at":null,"dependency_job_id":"a88d48dc-d652-41de-8682-0eb27af8be5e","html_url":"https://github.com/hazeliscoding/bfs-dfs-traveling","commit_stats":null,"previous_names":["faythbound/bfs-dfs-traveling","nekomata97/bfs-dfs-traveling","nekomatadev/bfs-dfs-traveling","spherehunteryrp/bfs-dfs-traveling","ducksoop/bfs-dfs-traveling","hazeliscoding/bfs-dfs-traveling"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hazeliscoding%2Fbfs-dfs-traveling","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hazeliscoding%2Fbfs-dfs-traveling/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hazeliscoding%2Fbfs-dfs-traveling/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hazeliscoding%2Fbfs-dfs-traveling/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hazeliscoding","download_url":"https://codeload.github.com/hazeliscoding/bfs-dfs-traveling/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244825654,"owners_count":20516592,"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":[],"created_at":"2024-11-27T22:13:49.345Z","updated_at":"2026-05-15T23:35:09.440Z","avatar_url":"https://github.com/hazeliscoding.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Traveling in BFS/DFS\nA fun and practical way to demonstrate Breadth-First Search and Depth-First Search with pathfinding on a grid for a second semester Data Structures and Algorithms univeristy course as a final project.  \n\n## Project Objective\n\nTo implement a graph data structure which can be edited, and traversed through with Breadth-First Search and Depth-First Search trversals. In this implementation, I have implemented a graph as a typical 2D grid which consists of cells, which are the vertices of this graph. Movement between cells can be represented as edges. Impassable cells (walls) are not part of the graph. This graph is also unweighted and undirected. The implementation of the search algorithms do not factor in any distances or heuristics.\n\n## Prerequisites\n* [CMake](https://cmake.org/)\n* [Qt5](https://www.qt.io/)\n\nAlso, make sure these packages are installed.\n```shell\nsudo apt-get install qtbase5-dev\nsudo apt-get install qtdeclarative5-dev\n```\n\n## Building\n\n``` shell\ncd mkdir build \u0026\u0026 cd build\ncmake ..\nmake\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhazeliscoding%2Fbfs-dfs-traveling","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhazeliscoding%2Fbfs-dfs-traveling","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhazeliscoding%2Fbfs-dfs-traveling/lists"}