This is a basic Dijkstra's path finding algorithm visualizer. You set a start and an end tile. The algorithm starts searching each tile it can and finally finds and displays the shortest path.
Radix UI and ShadCN components were used to create the UI of the website. Moreover, Vite was used to create this React Project.
This project was deployed to Github Pages and can be tested there. No servers or databases were used in this Project.
338219482-a0164e19-397d-411b-a6f3-e645b9fd0c9d.mp4
This template provides a minimal setup to get React working in Vite with HMR and some ESLint rules.
Currently, two official plugins are available:
- @vitejs/plugin-react uses Babel for Fast Refresh
- @vitejs/plugin-react-swc uses SWC for Fast Refresh