Assertion: graph | /r/HasProperty | a unique shortest path
Facets:
value: for every pair of vertices
type: OTHER
Source sentences:
text: A graph such that for every pair of vertices there is a unique shortest path connecting them is called a geodetic graph.