VariousWords beta
Related Terms:
directed
multitree
undirected path
digraph
strongly connected
acyclic digraph
indegree
ultragraph
outdegree
digon
graph
directed edge
pseudodigraph
edge
gammoid
parity game
ordered pair
strongly connected component
call graph
directed acyclic graph
multidigraph
digraphon
directed path
Noun
Definition: 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.