Definition:Distance (Graph Theory)/Directed Graph

Definition
Let $G = \tuple {V, E}$ be a directed graph.

Let $u, v \in V$ be vertices of $V$.

The distance from $u$ to $v$ is the length of the shortest path from $u$ to $v$.