Table 3 Procedure FindPathStart

FindPathStart (P', u):

Input: path P' = (p₁,..., p _x ), node u

1:

i ← x

2:

while i > 0 do

3:

   u ← v ∈ {v | (u, v) ∈ Γ (p _i )}

4:

   i ← i - 1

5:

Return u