Flight planning system android application.
Explore the docs »
Report Bug
·
Request Feature
Welcome to the Flight Planning System, an Android app that helps users find the most efficient route through a network of airports. We used a weighted and directed graph to represent the connections between airports, with distance and cost information stored on the edges. To implement the graph, we employed an adjacency list approach using a custom linked list and Java's HashMap. The AirportWrapper class is used to encapsulate the airports for Dijkstra's algorithm, which we implemented using Java's PriorityQueue (MinHeap). With this app, users can easily find the shortest and cheapest path between airports.
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
Distributed under the MIT License. See LICENSE.txt for more information.
Charaf Mrah - @charafmrah - charaf4charaf@gmail.com
Project Link: https://github.com/charafmrah/flight-planning-system