from Wiktionary, Creative Commons Attribution/Share-Alike License
- n. A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
Sorry, no etymologies found.
Sorry, no example sentences found.
Wordnik is becoming a not-for-profit! Read our announcement here.