A directed graph is a set of nodes (or vertices) with a set of ordered pairs of nodes called the arrows.

The custom is to use the unqualified term 'graph' for the unordered variant.

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.

Log in or register to write something here or to contact authors.