Assertion: graph's path | /r/HasProperty | connected by a length-one path
Facets:
Source sentences:
text: In all of these transitive closure algorithms, it is possible to distinguish pairs of vertices that are reachable by at least one path of length two or more from pairs that can only be connected by a length-one path.