Suppose I have a graph G = (V,E). There might be multiple edges between two vertices.

Given a set of edges X, I want to find the set of vertices W in V such that for w in W, there is a cycle that starts and ends at w with at least one edge of the cycle contained in X.