Research on Hamiltonian Cycle Based on Path with Interface
一个由接口路径求Hamilton回路的算法研究

In order to find all Hamiltonian cycles in a digraph, to begin with, it presented an encoding method for the power set, which converts the problem of Hamilton circuits into the computation of hierarchical matrix Secondly, it estimated the complexity of algorithm with the proof of Xiaerci guess.Finally, it gave the exact algorithm for CTSP.