A revolutionary way to improve the high-speed, exhausted Hamiltonian circuit

A revolutionary way to improve the high-speed, exhausted Hamiltonian circuit

An exhaustive list of all Hamiltonian loops of an arbitrary connected graph is more convincing to find the shortest circuit-the travel-business circuit. In the past, every step forward, to check whether the formation of voids, because once the line into a hole, no matter how many steps forward, ultimately, it is impossible to do a loop. The way to check the hole is to check that all the points that are not in the chain can be connected to one piece, although the first Hamiltonian can be quickly obtained, but the calculation of this method is huge. In order to reduce the amount of computation, the method of checking the void is to check whether the point around the chain head is connected, the connected graph of the dry 560 points, the conservative estimate, the speed of the Hamiltonian circuit should be increased 100,000 times times,

A revolutionary way to improve the high-speed, exhausted Hamiltonian circuit