Phrase guide

directed graph

noun · 1 senses · updated from the 2026-07-25 local source snapshot

Definitions and examples are grouped by meaning. Pronunciation, history, word forms, translations, descendants, synonyms, antonyms, derived terms, and related words appear whenever the source provides them.

Sound

Pronunciation

Each Play button uses your device's default local English voice, or a natural local fallback. The selected voice name appears after playback. This is synthesized speech, not a source recording.

No pronunciation record was provided for this word.

1

noun

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

Definition source: English Wiktionary via Wiktextract

Topics: graph-theory, mathematics, sciences

Examples

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

Meaning relationships

Synonyms: digraph

Antonyms: undirected graph

History

Etymology

No etymology was provided for this word.

Across languages

Translations

26 source translations are retained for this English entry.

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