This an implementation in JSP and Java of an adjacency list graph that uses Dijkstra's algorithm to find the shortest path between airports. An adjacency list is used that takes vertices (each of the airports) and edges (the distance between two airports) to create a graph. This graph can then be used to calculate all of the paths between the vertices and the distances between them. AJAX is used to select the airports and then run a java program to create the graph with a set list of airports and locations and then return the distance between two airports.