directed graph
Definitions
A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
Equivalents
9 more languages
Examples
“A directed graph (A, R) is a set⟳ of vertices A together with an incidence relation R: if aRb then there is an edge going from A to B.”
CEFR level
B2
Upper Intermediate
This word is part of the CEFR B2 vocabulary — upper intermediate level.
This word is part of the CEFR B2 vocabulary — upper intermediate level.
See also
Know this word better than we do? Language is a living thing — help us keep it growing. Collaborate with Babel Free