English
Noun
wikipedia
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.
Synonyms
digraph
Translations
French: graphe orienté
Japanese: ����� (yūk� gurafu)
mid
Mandarin: zh-ts|���|��� (y�uxià ngtú)
See also
undirected graph
|