https://github.com/hazeliscoding/bfs-dfs-traveling
A demo of BFS and DFS pathfinding on a unweighted, undirected graph.
https://github.com/hazeliscoding/bfs-dfs-traveling
Last synced: 11 months ago
JSON representation
A demo of BFS and DFS pathfinding on a unweighted, undirected graph.
- Host: GitHub
- URL: https://github.com/hazeliscoding/bfs-dfs-traveling
- Owner: hazeliscoding
- Created: 2019-04-23T22:59:58.000Z (almost 7 years ago)
- Default Branch: master
- Last Pushed: 2019-05-18T19:07:39.000Z (almost 7 years ago)
- Last Synced: 2025-03-15T06:52:12.955Z (12 months ago)
- Language: C++
- Homepage:
- Size: 116 KB
- Stars: 0
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Traveling in BFS/DFS
A 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.
## Project Objective
To 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.
## Prerequisites
* [CMake](https://cmake.org/)
* [Qt5](https://www.qt.io/)
Also, make sure these packages are installed.
```shell
sudo apt-get install qtbase5-dev
sudo apt-get install qtdeclarative5-dev
```
## Building
``` shell
cd mkdir build && cd build
cmake ..
make
```