Hello,

How would I go about efficiently finding if an even cycle exists in a directed graph? I know for odd cycles we can simply run a bipartition algorithm and if it doesn't work we know there exists an odd cycle. But how do I do that for even cycles?