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 - wikipedia

# See also * Definition * Types of directed graphs * Basic terminology * Indegree and outdegree * Degree sequence * Directed graph connectivity * See also * Notes * References