Please read the new rule regarding the restriction on the use of AI tools. ×

olivergrant's blog

Even Cycles
By olivergrant, history, 7 months ago, In English

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?

  • Vote: I like it
  • +8
  • Vote: I do not like it

»
7 months ago, # |
  Vote: I like it -10 Vote: I do not like it

Easy and general answer to many questions: Search on a popular search engine (for example google).

Third search result: link

Now, you can go ahead and look over the comments. You also have explanations of why some solutions are wrong.

→ Reply
»
7 months ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

nvm

→ Reply
  • »
    »
    7 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    Because an even cycle can exist even though the graph is not bipartite

    → Reply