This is my very first React project. The idea is inspired by Clément Mihailescu.
This website visualizes several pathfinding algorithms, including BFS, DFS, Dijkstra, Best First, and A*. Users can learn the search pattern of different algorithms by visualizing them in different mazes. The website also provides the features such as maze customization, speed control, etc.
You can visit the website through the following link
For now, the visualizer only supports two types of heuristics, the Manhatten distance, and Euclidean distance. Since the grid only allows 4 directions of movement, the Manhatten distance is preferred.
For more details about heuristics, please look at this website.