This JavaFX application calculates the fastest routes in the Brussels metro system (STIB - Société des Transports Intercommunaux de Bruxelles) using Dijkstra's algorithm. This is a school project.
- Find the fastest route between any two metro stations in Brussels.
- Interface built with JavaFX and FXML.
- Efficient pathfinding algorithm implemented with Dijkstra's algorithm.
- Clone this repository:
git clone https://github.com/KBluelvl/Chess.git
- Run
StibView.java
in IDE.