\begin{definition}[Definition:Reachable/Definition 1]
Let $G = \struct {V, A}$ be a directed graph.
Let $u, v \in V$.
Then $v$ is '''reachable''' from $u$ {{iff}} there exists a directed walk from $u$ to $v$.
\end{definition}