User can specify a starting and ending location with constraints such as date, stops, aircraft provider, and max/min flights, the finder will return the optimal routes. This project is implemented in C++ with the Dijkstra's algorithm using priority queue to determine the flights with shortest distance from one node to another node.