The actual task of traveling salesman, consisting of finding in the usual self-weighted count of Hamiltonian way of the least, is examined, where weight of cycle concernes as sum of scales, ribs incoming in him. The new algorithm of determination of the shortest Hamiltonian cycles, which does not guarantee finding of exact decision, is offered, but probably is more rapid, than existing. Accordance of the shortest Hamiltonian cycle hatches in a count to the Hamiltonian cycle in the structure of cliques of count. Efficiency of disintegration of structure is proved to one cycle on the basis of procedure of А..
"Opredelenye kratchaishykh hamyltonovыkh tsyklov v neoryentyrovannom hrafe" ,
Information Processing Systems,