Undirected graph

From Fresh Dictionary

Contents

English

Noun phrase

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

See also

Personal tools