, e k with k > 0 such that r = src(e 1 ), tar(e i ) = src(e i+1 ) for all 1 ≤ i < k, and tar(e k ) = v. We use standard terminology regarding trees.
a node v is a child of a node u if out(u) ∩ in(v) = ∅.