Algo(G,A,u,v)
INIT(G)
Z = nil
dfs_visit(G,u,c1)
dfs_visit(GT,v,c2)
for each a in A do
	if c1[a]=b || c2[a]=b then
		Z = Z u {a}
return Z