Assertion: graph's vertex | /r/HasProperty | \displaystyle u
Facets:
Source sentences:
text: In the case of a directed graph the distance d ( u , v ) {\displaystyle d(u,v)} between two vertices u {\displaystyle u} and v {\displaystyle v} is defined as the length of a shortest directed path from u {\displaystyle u} to v {\displaystyle v} consisting of arcs, provided at least one such path exists.
text: d ( u , v ) {\displaystyle d(u,v)} between two vertices u {\displaystyle u} and v {\displaystyle v} of a finite graph is the minimum length of the paths connecting them.
text: (v)} of a graph vertex v {\displaystyle v} in a connected graph G {\displaystyle G} is the maximum graph distance between v {\displaystyle v} and any other vertex u {\displaystyle u} of G {\displaystyle G} .