new TSP-approximation algorithm

I have two TSP-approximation algorithms so far.
The new one has much smaller runtimes.
Toggle between the algorithms by setting algo = 1 or 2 (on line 15).

The new algo to find the shortest Flowerpath is:
a) find mean location of all known flowers
b) find flower who is farthest away from this mean location (ignoring obstacles, as this obstacles would make minor differences)
c) find shortest path to that flower.

This has the effect of "spiralling into" the mean location.