3.Next

In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs.

Definition

In formal terms, a directed graph is an ordered pair 1=''G'' = (''V'', ''A'') where
*

3.Next