Flight planning system android application.
Explore the docs »
Report Bug
·
Request Feature
This project was created for a uni class. It’s an Android app that helps users find the shortest and cheapest routes between airports. The app uses a weighted, directed graph to model airport connections, with distances and costs stored on the edges. We implemented the graph using an adjacency list with a custom linked list and Java’s HashMap. For finding the best routes, we used Dijkstra’s algorithm with Java’s PriorityQueue.
Distributed under the MIT License. See LICENSE.txt for more information.