undirected graph

---

Noun

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

• graph

Antonyms

• directed graph

Translations

• Portuguese: grafo não-orientado

---

This text is extracted from the Wiktionary and it is available under the CC BY-SA 3.0 license | Terms and conditions | Privacy policy 0.003