undirected graph

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Noun[edit]

undirected graph (plural undirected graphs)

  1. (graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).

Synonyms[edit]

Antonyms[edit]

Translations[edit]