Assertion: directed graph | /r/HasProperty | ordered pair
Facets:
value: in formal terms
type: OTHER
Source sentences:
text: In one restricted but very common sense of the term, a directed graph is an ordered pair G = (V, E) comprising:
text: A directed graph or digraph is an ordered pair D = (V, A) with
text: In one restricted but very common sense of the term, a directed graph is an ordered pair G = (V, E) comprising:
text: In formal terms, a directed graph is an ordered pair G = (V, A) where