A directed graph is a graph in which the edges are ordered pairs of vertices. The edge connecting and is denoted by .