Definition:Path in Digraph/Predecessor

Definition

Let $D = \struct {V, E}$ be a digraph.

Let $P$ be a path in $D$ such that the vertices of $P$ are $v_1, v_2, \ldots, v_n$.

Let $v_j$ be a vertex of $P$ such that $j > 1$.

Then the predecessor (vertex) of $v_j$ is the vertex $v_{j - 1}$.

That is, if $v \to w$ is an arc in $P$, $v$ is the predecessor (vertex) of $w$.

Also see

• Definition:Successor Vertex

Sources

• 1979: John E. Hopcroft and Jeffrey D. Ullman: Introduction to Automata Theory, Languages, and Computation ... (previous) ... (next): Chapter $1$: Preliminaries: $1.2$ Graphs and Trees: Directed Graphs