A digraph (or a directed graph) is a graph in which the edges are directed. (Formally: a digraph is a (usually finite) set of vertices V and set of ordered pairs ( a,b) (where a, b are in V) called edges. The vertex is the initial vertex of the edge and the terminal vertex.
a pair of signs or symbols (two graphs), which together represent a single sound or a single linguistic unit. The English writing system employs many digraphs (for example, th, ch, sh, qu, and so on). The same two symbols may not always be interpreted as a digraph (for example, ca th ode versus ca th ouse).
A geometric diagram consisting of a finite number of dots called vertices joined by a finite number of curved or straight line segments with an arrow on each called directed edges.
A digraph is a graph in which the edges are directed and called arcs. More formally, a digraph is a set of vertices together with a set of ordered pairs of the vertices, called arcs. Here is a digraph on 5 vertices
a finite, non-empty set of points called vertices, together with some directed edges joining these points
a graph in which each edges has a direction
an oriented all-positive ordinary graph
an oriented graph if it is an orientation of some undirected graph
a special type of graph--one in which the relationships among vertices are asymmetrical
a graph in which every edge is directed
See directed graph.