This project provides an efficient solution to the shortest-time pathfinding problem on a transportation map. The map is represented as a weighted graph where:
- Nodes represent intersections.
- Edges represent roads with defined speeds.
The goal is to calculate the least time required to move from a source location to a destination, considering:
- Walking up to a maximum distance
Rat the beginning and end. - Using a vehicle in between at the road鈥檚 given speed.
- Input: A map file with intersection coordinates and road connections, and a queries file with source/destination coordinates and allowed walking distance
R. - Output: For each query, provide:
- Optimal path (intersections).
- Total time (in minutes).
- Total distance, walking distance, and vehicle distance (in km).
- Execution time (excluding and including I/O).