title: Networkx hamiltonian cycle
body: <p>I would like to add Hamilton cycle functionality to my design, but I'm not sure how to do it. I know there are algorithms like <code>nx.is_tournament.hamiltonian_path</code> etc. But I don't know how to implement them exactly. Below is an example of an euler cycle that works fine for me and I would like to create a Hamilton cycle in a similar way.</p>
  
  <pre class="lang-py prettyprint-override"><code>def isEulerian():
      isEulerian = nx.is_eulerian(myGlobalGraph)
      if isEulerian == True:
          trueInfo = 'this is Eulerian graph'
          trueInfo2 = '\n'
          Log.insert(INSERT, trueInfo)
          Log.insert(INSERT, trueInfo2)
          eulerianCircuit = list(nx.eulerian_circuit(myGlobalGraph))
          eulerianCircuitInfo = 'Order of action:'
          eulerianCircuitInfo2 = '\n'
          Log.insert(INSERT, eulerianCircuitInfo)
          Log.insert(INSERT, eulerianCircuitInfo2)
          for i in range(len(eulerianCircuit)):
              x = eulerianCircuit[i][::2]
              eulerianCircuitInfo3 = x
              eulerianCircuitInfo4 = ' &gt; '
              Log.insert(INSERT, eulerianCircuitInfo3)
              Log.insert(INSERT, eulerianCircuitInfo4)
          eulerianCircuitInfo5 = '\n'
          Log.insert(INSERT, eulerianCircuitInfo5)
          eulerianCircuitInfo6 = '\n'
          Log.insert(INSERT, eulerianCircuitInfo6)
      elif isEulerian == False:
          falseInfo = 'this is not Eulerian graph'
          falseInfo2 = '\n'
          falseInfo3 = '\n'
          Log.insert(INSERT, falseInfo)
          Log.insert(INSERT, falseInfo2)
          Log.insert(INSERT, falseInfo3)
  </code></pre>