This project implements Dijkstra's Algorithm to calculate the shortest path between two locations in a city. Using real-world data stored in a CSV file, it dynamically creates a graph representation of the city map, allowing users to find the most efficient rout