In graph theory, a digraph is a directed graph. The same as a graph, except elements of the edge set are ordered pairs, not unordered pairs.

If (a,b) is an edge the edge (b,a) doesn't necessarily exist.