Assertion: graph's path | /r/HasProperty | unique shortest
Facets:
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.