What is "directed graph"

n. (context graph theory English) 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.

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph (that is a set of vertices connected by edges), where the edges have a direction associated with them.