The Contraction Hierarchies (CH) algorithm is a unique approach to computing shortest paths in large road network graphs. The work was originally presented in 2008 by Geisberger, Sanders, Schultes, and Delling [8] and has since served as a springboard for other advanced route-planning algorithms.
This site serves as an illustrative introduction to route-planning algorithms and the core components of contraction hierarchies.