Green Flag.
Draws lines between closest neighbours when points are trying to equalize their distance to their neighbours. More precisely : 11 Points are randomly placed. Each point searches for his 4 closest neighbors, then is accelerated in order to equalize the distances between itself and each of this neighbours, as if it were attached to each of its neighbour by a spring of length the average of the distances. There also is some friction slowing the points down. The links between points and their neighbours are drawn, during 1000 iterations of this process. One can easily edit the number of points and/or of numbers to consider. However, be aware that the code is not optimized at all and too many points quickly becomes laggy. One thing to try is setting the number of neighbours to 2, to see the system come to an equilibrium.
