CASE STUDY
Minimum Flight Distance
Minimum flight distance finder using a database of airports and graph algorithms.
Abstract
Collected over 1,000 airports registers to implement a minimum flight distance finder in university’s course project by implementing a JSON - Graph parser, A-Star algorithm and a simple graphical interface. Awarded as the best project.
Desktop Application
The desktop application is a simple graphical interface that allows a user to select a starting and ending airport, and then find the shortest path between the two airports.
The airports database is a JSON file which is mapped to a graph in C++. The shortest path is found using the A-Star algorithm and displayed in a list to the user.
All the data structures and algorithms are implemented using the typical header and implementation files.
