\begin{definition}[Definition:Adjacent (Graph Theory)/Edges/Digraph]
Let $G = \struct {V, E}$ be a digraph.
Two arcs $e_1, e_2 \in E$ of $G$ '''adjacent''' if there exists a vertex $v \in V$ to which they are both incident.
Otherwise they are '''non-adjacent'''.
\end{definition}