Assertion: directed graph | /r/HasProperty | connected
Facets:
value: strongly
type: DEGREE
Source sentences:
text: A strongly connected graph is a directed graph in which every ordered pair of vertices in the graph is strongly connected.
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 graph is strongly connected if there are oppositely oriented directed paths containing each pair of vertices.