Assertion: graph's path | /r/HasProperty | directed
Facets:
Source sentences:
text: A directed graph is strongly connected or strong if it contains a directed path from x to y and a directed path from y to x for every pair of vertices {
text: A directed path is a directed trail in which all vertices are distinct.