directed graph

English

Wikipedia

Noun

directed graph (plural directed graphs)

1. (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.

   A directed graph (A,R) is a set of vertices A together with an incidence relation R: if aRb then there is an edge going from A to B.

Antonyms

• undirected graph

Synonyms

• digraph

Translations

type of graphs

• Chinese: trad. 有向圖, simpl. 有向图 (yǒuxiàngtú)
• Czech: orientovaný graf (cs) m
• Danish: orienteret graf (da) c
• Dutch: gerichte graaf (nl) m, digraaf (nl) c
• Finnish: suunnattu verkko

• French: graphe orienté (fr) m
• Italian: grafo orientato, grafo diretto
• Japanese: 有向グラフ (yūkō gurafu)
• Polish: graf skierowany (pl) m
• Portuguese: grafo orientado (pt), digrafo (pt) m
• Russian: ориентированный граф (ru) (orijentírovannyj graf) m