Dijkstra shortest path

In this project we use dijkstras algorithm to find the nearest distance between any 2 places in the city which're visualized as graph nodes.

How to run project

1. Clone the repository: git clone [repo-link]
2. Install dependencies: npm install
3. Run the development server: npm run dev
4. Open your browser and navigate to http://localhost:3000 to run and understand the project.

Techstack

This project was powered by

• Reactjs-Vite
• Tailwind CSS
• UI Frameworks

Consider giving a ✨ to the repo if you found this project informative and insightful as it really motivates me to keep doing so.