Pathfinding visualizer 🗺️️
Jun 30, 2020
Algorithms & Data Structures
2020
In this project, we implemented and tested four distinct graph-searching algorithms: A*, BFS, DFS, and Dijkstra. We evaluated their performance across a range of randomly generated maps of varying sizes to compare them and verify their theoretical big-O complexity.
If you're interested in learning more, you can explore the implementations here or read the full paper here.
