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)
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
Post a Comment