Graph – Hamilton Cycle

Graph – Hamilton Cycle

Hamilton cycle is a cycle that visits each VERTEX in the graph only once.

Note the difference with Euler Cycle, which is a cycle that visits each EDGE only once. Vertices in an Euler Cycle can be visited multiple times.

[Algorithm]
Unlike Euler Cycle, which has to satisfy some conditions, Hamilton Cycle is a backtracking problem.

Read full article from Graph – Hamilton Cycle