Hamilton cycle and Path in graph
write a program to find Hamilton cycle and Path in graph. A Hamilton path is a path that visits each vertex of a graph ( directed or undirected ) exactly once. The Hamilton path is called cycle when start vertex and the end vertex in Hamilton path is connected. The Hamilton cycle is also called Hamilton circuit or vertex tour.
Given an graph print the Hamilton Cycle. If graph does not contain a Hamilton Cycle , print “No Hamilton Cycle”. write C or C++ program.
The problem of finding whether a graph contains Hamilton Cycle or Path is NP-Complete problem.