\begin{definition}[Definition:Graph (Graph Theory)/Edge/Endvertex]
Let $G = \struct {V, E}$ be a graph or digraph.
Let $e = u v$ be an edge of $G$, that is, $e \in E$.
The '''endvertices''' of $e$ are the vertices $u$ and $v$.
\end{definition}