This project implements the A* algorithm to find the shortest path between two stations in the Paris Metro.
- Ensure you have Python installed.
- Clone this repository.
- Run the file
python.py
- Start station number (from 1 to 14)
- Start line (yellow, blue, red OR green)
- Destination station number (from 1 to 14)
- Destination line (yellow, blue, red OR green)
- Frontiers for each iteration of the A* algorithm
- Solution path
- Solution cost (total time in minutes)