Skip to content
/ STIB Public

JavaFX App to find the fastest path in Brussels metro using Dijkstra's algorithm.

License

Notifications You must be signed in to change notification settings

KBluelvl/STIB

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 

Repository files navigation

STIB

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.

Features

  • 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.

Installation

  1. Clone this repository:
    git clone https://github.com/KBluelvl/Chess.git
  2. Run StibView.java in IDE.

preview:

Main Interface Main Interface of the application.

image Displayed route between the selected metro stations.

Releases

No releases published

Packages

No packages published

Languages