directed graph

Noun

 * 1)  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.

Translations

 * Chinese:
 * Mandarin:
 * Czech: orientovaný graf, digraf
 * Danish: orienteret graf
 * Dutch: gerichte graaf,
 * Finnish: suunnattu verkko
 * French:
 * Italian: grafo orientato, grafo diretto, digrafo
 * Japanese: 有向グラフ
 * Polish: graf skierowany
 * Portuguese: grafo orientado, digrafo
 * Russian: ориенти́рованный граф,
 * Spanish: grafo dirigido
 * Swedish:
 * Tagalog: itinungong talangguhit