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.
How often have the words digram and directed graph occurred in a corpus of books? (source: Google Ngram Viewer )