Before revision: A spanner of a graph G is a subgraph H that approximately preserves its pairwise distances . Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs.
After revision: A spanner of a graph G is a subgraph H that approximately preserves shortest path distances in G . Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs.