Shortest path problem using OpenFlights. Final project for my data structure class (CS225 at UIUC).

This video introduces my final project for the CS225 data structure class at UIUC, which was done by me and my teammates Tina, Kevin, and Julian.
We chose to implement DFS, Dijkstra, and Landmark Path algorithms and find the shortest distance between two airports or among three airports in the world.
I will push the code to GitHub after the grading period for this class.