CONSTRUCTION OF A HAMILTONIAN PATH USING THE METHOD OF EXPANDING THE SELECTED AREA
The article considers a new approach to constructing a Hamiltonian path by the method of expanding the selected area. The work continues the cycle of research by the authors to find the optimal option for solving the traveling salesman problem. This method belongs to the class of greedy algorithms. The closest to the proposed method is the method known as the "Elastic Network Method".