\begin{definition}[Definition:Arborescence/Definition 1]
Let $G = \left({V, A}\right)$ be a directed graph.
Let $r \in V$.
$G$ is an '''arborescence of root $r$''' {{iff}}:
:For each $v \in V$ there is exactly one directed walk from $r$ to $v$.
\end{definition}