A roadnetwork can be considered as a graph with positive weights. The nodes represent road crossings and an edge is a road between two crossings. The weight of an edge is either the length of the associated road segment or the time needed to get from one end to the other. Using directed edges it is also possible to model one-way streets. Such graphs are special in the sense that some edges are more important than others for long distance travel (i.e. highways). This property has been formalized using the notion of highway dimension. There are a great number of algorithms that exploit this property and are therefore able to compute the shortest path a lot quicker than would be possible on general graphs.