This is a demonstration of an adjacency list graph. The graph uses an adjacency list to store airports and the distance between them. Select two airports and the program will use Dijkstra's algorithm to find the shortest distance between the two airports.