directed graph

English

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.

   Synonym: digraph

   Antonym: undirected graph

   Coordinate term: oriented graph

   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.

Translations

graph in which the edges are ordered pairs

Chinese: Mandarin: 有向圖 / 有向图 (zh) (yǒuxiàngtú) Czech: orientovaný graf m, digraf m Danish: orienteret graf c Dutch: gerichte graaf m, digraaf (nl) c Finnish: suunnattu verkko French: graphe orienté (fr) m German: gerichteter Graph m, Digraph (de) m Hindi: संयुक्ताक्षर m (sãyuktākṣar) Hungarian: irányított gráf (hu) Italian: grafo orientato, grafo diretto, digrafo m Japanese: 有向グラフ (ゆうこうグラフ, yūkōgurafu) Korean: 유향 그래프 (yuhyang geuraepeu) Norwegian: rettet graf (no) m Polish: graf skierowany m Portuguese: grafo orientado, digrafo m Russian: ориенти́рованный граф m (orijentírovannyj graf), оргра́ф (ru) m (orgráf) Spanish: grafo dirigido m Swedish: riktad graf (sv) c Tagalog: itinungong talangguhit

Further reading

• directed graph on Wikipedia.Wikipedia