Permutations of N Objects (+Travelling Salesman Problem)

https://www.desmos.com/calculator/udsi7kyfwc

The order function in the graph orders n objects according to a numbering system:

The function "d" takes an order and finds the distance it would take to travel between the objects indicated in the x1-y1 table

Then, I calculate the best cycle and path between the objects. A cycle is a travel that ends in the same place as it begins, and a path is a travel that only needs to go to all the "cities," or points.