What is another word for contraction hierarchy?
Pronunciation: [kəntɹˈakʃən hˈa͡ɪ͡əɹɑːki] (IPA) 
A contraction hierarchy is a graph optimization technique used to speed up pathfinding algorithms. Finding alternate words to describe this technique might help broaden one's understanding of the concept. Some possible synonyms for the term "contraction hierarchy" include compressed graphs, hierarchized networks, topologically reduced graphs, and speed-up graphs. Each of these synonyms indicates a form of graph optimization that reduces the number of nodes and edges in a graph to improve algorithmic efficiency. By understanding the different ways in which a contraction hierarchy can be described, we can gain insight into the various graph optimization techniques available and how they can be applied to different types of problems.
