This project was inspired by an interest to test the performance capabilities of the React framework. It is a pathfinder algorithm visualizer using the Djikstra and A-Star algorithms to calculate the shortest distance between two points. Ideally, the euclidean distance was considered for this project as its computation for a given node would not be too resource heavy for a single distance. The performance metrics can be changed by using different distance parameters for a more complex system.
This Project is currently hosted here: https://gracious-neumann-c1af48.netlify.app/
You can also check out my portfolio website here: https://georgeu-portfolio.netlify.app/