Educative Site Free Online Academic Courses Tutorials, Books with enough questions and answers
Hamilton Path
A Hamilton path is a path in a graph that visits every node (vertices) exactly once in a way that start and end node is different.
Hamilton Cycle
A Hamilton cycle in a graph is a cycle that visits every node (vertices) exactly once in a way that start and end node is same.
| Fig: The cycle a – b – e – c – d – f – g is Hamiltonian cyle |