Definition of "directed graph" []

• 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. (noun)

Wiktionary.org : Text is available under the Creative Commons Attribution-ShareAlike License