Before revision:  As a  well-known problem in NPC, the Hamiltonian Cycle Problem can be now resolved practically in deterministic polynomial time , so this problem is in P and we prove that the conjecture of P=NP holds .
After revision:  As a well-known problem in NPC, the Hamiltonian Cycle Problem can be now resolved practically in deterministic polynomial time for general graphs in the worst case .