Assertion: graph's g | /r/HasProperty | directed
Facets:
Source sentences:
text: If G is directed, we distinguish between incoming neighbors of v i (those vertices v j Î V such that (v j
text: If graph G = (V, E) is a directed graph, its transpose, GT = (V, ET) is the same as graph G with all arrows reversed.
text: If G is directed, we distinguish between in-degree (nimber of incoming neighbors) and out-degree (number of outgoing neighbors) of a vertex.