Directed Graphs

Definition: Directed Graph (Digraph)

A directed graph / digraph \((V, E)\) consists of a set \(V\) and a collection \(E\) of ordered pairs of elements of \(V\):

• The elements of \(V\) are called vertices or nodes;
• The elements of \(E\) are called edges or branches.