Graph for storing all of the intersection (vertex) and road (edge) information.
Uses your GraphBuildingHandler to convert the XML files into a graph. Your
code must include the vertices, adjacent, distance, closest, lat, and lon
methods. You'll also need to include instance variables and methods for
modifying the graph (e.g. addNode and addEdge).