The project is my try in interactively visualize pathfinding algorithms. The initial intentions where only to explore pathfinding, but later I realized that those algorithms did not had a play ground, so I extended it to include maze generation algorithms
I have tried to focus first on "the most popular" choises - later those can be really easily extended via inheriting an interface. In section Feature Plans we will cover what I want to add next.
Currently the project supports the visualisation of:
- A* algorithm
Pathfinding algorithms to be added in preceedance order:
- Flow Fields - I really want to explore the implementation of "Flow Flied" as it is something bit different
- Any-Angle
- Djikstra
- Greedy
- BFS
- DFS
Note: Gifs are glitchi because of video recording not program execution.