A characterization of the set of all shortest paths in a connected graph

Abstract

Let G be a (finite undirected) connected graph (with no loop or multiple edge). The set y of all shortest paths in G is defined as the set of all paths £ in G with the property that if £ is an arbitrary path in G joining the same pair of vertices as £, then the lenght of