a directed Hamiltonian cycle DHC in a directed graph G+(V,E) is a directed cycle of length n=|V|,where |V| is the number of vertices in G.So, the cycle goes through every vertex exactly once and then returns to the starting vertex. The DHC problem is to determine if a given directed graph G has a Hamiltonian cycle.Show that DHC is NP-Hard.
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---