Definitions from Wiktionary (undirected graph)
▸ noun: (graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
▸ Words similar to undirected graph
▸ Usage examples for undirected graph
▸ Idioms related to undirected graph
▸ Wikipedia articles (New!)
▸ Words that often appear near undirected graph
▸ Rhymes of undirected graph
▸ Invented words related to undirected graph
▸ noun: (graph theory) A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
Similar:
undirected path,
nontree,
unknot,
nonbetweenness,
nontransversality,
unidirection,
nonsequentiality,
nonelement,
nonleaf,
nondegenerate,
more...
▸ Words similar to undirected graph
▸ Usage examples for undirected graph
▸ Idioms related to undirected graph
▸ Wikipedia articles (New!)
▸ Words that often appear near undirected graph
▸ Rhymes of undirected graph
▸ Invented words related to undirected graph