We consider the problem of computing compact routing tables for weighted, undirected graphs. Our main contribution is a unified distributed framework for constructing compact routing schemes for graphs that admit a small collection of short paths that nearly separate the graph. The framework is fully distributed and relies only on two generic primitives: single-source approximate distance computation and minor-aggregation. Both are efficiently implementable in CONGEST and the novel HYBRID model. In particular, they require \(\smash {\tilde{O}}{({\textsc {HD}})}\) rounds in the CONGEST model where \({\textsc {HD}} \) is the graph’s hop-diameter and \(\smash {\tilde{O}}(1)\) rounds in HYBRID. Specifically, we apply our framework to four different important graph families. In all four cases, we assume that the graphs are weighted, undirected and have polynomially bounded edge weights.