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.
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.
Also, make sure these packages are installed.
sudo apt-get install qtbase5-dev
sudo apt-get install qtdeclarative5-devcd mkdir build && cd build
cmake ..
make