title: Hamiltonian path algorithm
body: <p>I have a project where I have to find, if it exists, an hamiltonian path in a undirected unweighted graph with two different algorithms. I already implemented an heuristic algorithm using  backtracking but I've been looking for the other and I can't seem to find it.</p>
  
  <p>So my question is, which algorithm do you know to find an hamiltonian path other than using backtracking?</p>
  
  <p>EDIT : After looking at several other posts, I found that we could find an hamiltonian path by using the longest path algorithm and check if the length of the path equals number of vertex - 1. I'd like to know if this is true or not.</p>
  
  <p>Thanks in advance.</p>