The "Plan a Flight Project" is a software that uses graph data structures and backtracking algorithms to plan efficient flight routes between cities, outputting the top 3 plans based on time or cost. It's run from the command line and follows robust OOP design principles.

This program utilizes an iterative backtracking algorithm, and takes an input data file of all flights in various cities, and generates an undirected graph to map out the connections. Then, it takes a second input file for requested trips (City A to B), and generates the most efficient flight travels, based on the user's preference of time or cost.