Welcome to Fast Flight! This Java application uses Dijkstra's algorithm to find and demonstrate the shortest path between countries on an interactive map using JavaFX and Gluon Maps.
Built on the Gluon starter template, this application uses OpenStreetMap tiles in JavaFX. You can find it here: Gluon Starter.
mvn gluonfx:run- or manually from Maven >> Plugins >> gluonfx:run
- Finds and displays the shortest path between selected countries.
- Enhances user experience with smooth animation and simple abstract UI.
- Displays shortest path information: Distance and the path taken between the selected countries.
- Displays a map containing the entire flight path from source to destination countries.
-
Dijkstra's Algorithm:
- Efficiently calculates the shortest path in a weighted graph.
- Visualization of the algorithm's output step-by-step on the map.
-
JavaFX and Gluon Maps Integration:
- Uses JavaFX for the user interface and interactive elements.
A list of the basic requirements can be found online in the Gluon documentation.
This is a list of all the features that were selected when creating the sample:
- javafx-base
- javafx-graphics
- javafx-controls
- Maps: cross-device map interfacing
