big o - Hamiltonian circuit -


What is the biggest complexity of finding Hamiltonian circuits in Markov series using DFS?

Big O notation gives upper limit, ie bad case running time. For the Hamiltonian cycle it can be called O (N ^ N)


Comments

Popular posts from this blog

c# - How to capture HTTP packet with SharpPcap -

php - Multiple Select with Explode: only returns the word "Array" -

php - jQuery AJAX Post not working -