undirected graph

Fetched 2026-10-26 (cache).

Synonyms: directed graph

Antonyms: directed graph

Related words from Datamuse; suggestions, not definitions.

Noun

1. {{lb|en|graph theory}} A [[graph]] in which the [[edge]]s are not [[ordered]], so the edge (a, b) is identical to the edge (b, a).

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