One of the 7 problems of the millennium is the computer problem P vs NP: if it is easy to verify that the solution to a problem is correct, is it also easy to solve the problem? Typical of NP problems is the Hamiltonian path problem: given N cities to visit, how can I do this without visiting a city twice? If you give me a solution I can easily check that it is correct, but I can't find a solution that easily.

This program solves the P vs NP problem by demonstrating the Hamiltonian path and a serious preliminary answer that is not easy the first time, but gradually becomes easier with observation of the solution.

Since every 2-dimensional positional map can be expressed in terms of (X, Y)... (Latitude, longitude) that is what you will need for this program which will return the problem solved with the real distance units, it has 2 options: the random option for testing, the program generates the positions at random and in deterministic you generate the position.
The problem resolution method is complete and simple, but given that there are several decision conditions, it was a little more complicated to translate it into a programming language. I would like to assume that the code works 100% of the time, but it would be impossible for me to do so. all the necessary tests so this would be the release version waiting for you to contact the programmer if you find resolution errors they should be very isolated errors.
greetings_Yucatan_chino_610