Skip to content
ontologydriven
Sign out

Dictionary

Words, grammatical forms and meanings linked to the ontology.

directed graph en · NOUN

Meanings

  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.
    • 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.

Forms

SpellingFeaturesLabelsSource
directed graphs Number=Plur lexicographic

Antonyms

undirected graph

Coordinates

oriented graph

Synonyms

digraph

Translations (26)

nl gerichte graaf (graph in which the edges are ordered pairs) · ru оргра́ф (graph in which the edges are ordered pairs) · cs orientovaný graf (graph in which the edges are ordered pairs) · no rettet graf (graph in which the edges are ordered pairs) · it digrafo (graph in which the edges are ordered pairs) · pt digrafo (graph in which the edges are ordered pairs) · nl digraaf (graph in which the edges are ordered pairs) · hi संयुक्ताक्षर (graph in which the edges are ordered pairs) · pt grafo orientado (graph in which the edges are ordered pairs) · de gerichteter Graph (graph in which the edges are ordered pairs) · ja 有向グラフ (graph in which the edges are ordered pairs) · hu irányított gráf (graph in which the edges are ordered pairs) · de Digraph (graph in which the edges are ordered pairs) · ru ориенти́рованный граф (graph in which the edges are ordered pairs) · it grafo orientato (graph in which the edges are ordered pairs) · fi suunnattu verkko (graph in which the edges are ordered pairs) · ko 유향 그래프 (graph in which the edges are ordered pairs) · sv riktad graf (graph in which the edges are ordered pairs) · cs digraf (graph in which the edges are ordered pairs) · it grafo diretto (graph in which the edges are ordered pairs) · da orienteret graf (graph in which the edges are ordered pairs) · pl graf skierowany (graph in which the edges are ordered pairs) · fr graphe orienté (graph in which the edges are ordered pairs) · es grafo dirigido (graph in which the edges are ordered pairs) · tl itinungong talangguhit (graph in which the edges are ordered pairs) · cmn 有向圖 /有向图 (graph in which the edges are ordered pairs)