Assertion: graph's component | /r/HasProperty | connected
Facets:
value: strongly
type: DEGREE
Source sentences:
text: An arbitrary directed graph may also be transformed into a DAG, called its condensation, by contracting each of its strongly connected components into a single supervertex.
text: Also, if a directed graph has been divided into strongly connected components, cycles only exist within the components and not between them, since cycles are strongly connected.