undirected graph
Meanings
noun
- A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
Word forms
Synonyms
Antonyms
Previous
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.