directed graph

Fetched 2026-10-26 (cache).

Synonyms: undirected graph

Antonyms: undirected graph

Related words from Datamuse; suggestions, not definitions.

Noun

1. {{senseid|en|Q1137726}} {{lb|en|graph theory}} A [[graph]] in which the [[edge]]s are [[ordered pair]]s, 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.

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.