The algorithm is very simple and suitable for finding all undirected Hamiltonian circuits in general undigraph.
算法简便，适合于求解一般无向图中全部哈密顿回路。
2
Based on analyzing existed structures of undigraph and characteristics of 2d drawing, Classified Adjacency List which is an improving structure of undigraph is presented.
To solve the model, the shortest path and its length of every two nodes in the incomplete undigraph are calculated with FLOYD algorithm, and a predatory search algorithm is designed for the solution.