undirected graph
noun1
Graph theory, Mathematics, Sciences A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
noun
Graph theory, Mathematics, Sciences A graph in which the edges are not ordered, so the edge (a, b) is identical to the edge (b, a).
Entry derived from the Wiktionary, under licence CC BY-SA 4.0 — list of authors.
Do you accept non-essential analytics cookies?