Assertion: directed graph | /r/HasProperty | strong
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 {