Assertion: graph's vertex | /r/HasProperty | distinct
Facets:
Source sentences:
text: In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges).
text: Some authors do not require that all vertices of a path be distinct and instead use the term simple path to refer to such a path.
text: Some authors do not require that all vertices of a directed path be distinct and instead use the term simple directed path to refer to such a directed path.