undirected graph
Jump to navigation
Jump to search
English[edit]
Noun[edit]
undirected graph (plural undirected graphs)
- (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]
type of graph
|