We don't have synonyms for directed graph yet — it may be a rare, specialized, newly coined, or misspelled word. The closest thesaurus entries we have are undirected graph.
We don't have any synonyms for directed graph yet.
(n) :
(graph theory) 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.
(n) :
(graph theory) 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.