Davedere

ALGO(G,X,u,v)
INIT(G)
dfs_visit(GT,v,c1)
dfs_visit(G,u,c2)
for each x in X do
	if(c1[x]=n && c2[x]=n)then
		if(c1[u]=b || c2[u]=b)then
			if(c1[v]=b || c2[v]=b)then
				return false
	return true