0
9.6kviews
What is Hamiltonian cycle? Write an algorithm to find all Hamiltonian cycles.

Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm

Marks: 10 M

Year: May 2015

1 Answer
0
79views
  • In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a Hamiltonian path that is a cycle.

enter image description here

  • Consider the problem of a salesman who wants …

Create a free account to keep reading this post.

and 3 others joined a min ago.

Please log in to add an answer.