directed graph love

Definitions

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.

Etymologies

Sorry, no etymologies found.

Examples

Sorry, no example sentences found.

Wordnik is becoming a not-for-profit! Read our announcement here.

Comments

Log in or sign up to get involved in the conversation. It's quick and easy.