Click here to Skip to main content
15,867,308 members
Please Sign up or sign in to vote.
3.00/5 (2 votes)
See more:
Here I have a directed graph G. I need to to determine whether there exists a
set of vertex-disjoint cycles so that each vertex belongs to a cycle.

I'm not sure if this can be done in polynomial time or if its NP-Complete? Can anyone atleast point me in the right direction?
Posted
Comments
Andreas Gieriet 16-Apr-14 19:38pm    
What does your text book tell about these terms and how to approach complexity calculations. Did you skip some of the first pages ;-)
Cheers
Andi

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900