tsp_convex

rubin_sim.scheduler.utils.tsp_convex(towns, optimize=False, niter=10)

Find a route through towns

Parameters:

townsnp.array (shape n,2)

The points to find a path through

optimizebool (False)

Optional to run the 3-optional transformation to optimize route

niterint (10)

Max number of iterations to run on optimize loop.

Returns:

indices that order towns.