This project was my first real taste of React, and it helped me review some of my data structures and algorithms as well. Inspired by Clement Mihailescu, I took my first steps into the world of React and created NavPath, where people can see different pathfinding algorithms in action. You can check out the result at: https://vironaray.github.io/NavPath/
- Breadth-First-Search (BFS): an unweighted algorithm that utilizes a queue structure and guarantees an optimal solution
- Depth-First-Search (DFS): an unweighted algorithm that utilizes a stack structure and does not guarantee an optimal solution
- Dijkstra's Algorithm: a well-known, weighted algorithm that utilizes a priority queue and guarantees and optimal solution
- A* : an algorithm that improves upon Dijkstra's algorithm by implementing heuristics
If you would like to report any bugs, make recommendations, or just let me know your thoughts about this project in general, you can contact me at viroshan.narayan@gmail.com.