In combinatorics, a directed graph or digraph is a graph in which the edges have an explicit direction, thus the set of edges becomes a set of ordered pairs.