directed graph

English

A simple directed graph.

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

   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

type of graphs

• 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
• Italian: grafo orientato, grafo diretto, digrafo m
• Japanese: 有向グラフ (yūkō gurafu)
• 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