directed graph

== English == === Noun === directed graph (plural directed graphs) (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. Synonym: digraph Antonym: undirected graph Coordinate term: oriented graph ==== Translations ==== === Further reading === directed graph on Wikipedia.Wikipedia