PYME.Analysis.points.traveling_salesperson.sort module¶
- PYME.Analysis.points.traveling_salesperson.sort.greedy_sort(positions, start_index=0, distances=None)¶
Nearest-neighbors path optimization.
- Parameters
- positions: 2darray
Positions array, size n x 2
- start_index: int
Index to start path from.
- distances: ndarray
[optional] distance array, for which distances[i, j] is the distance from the ith to the jth point. Will be calculated if not provided.
- Returns
- route: 1darray
array of indices defining the path
- og_distance: float
distance of path traversing positions in their original order
- final_distance: float
final distance after path optimization
- PYME.Analysis.points.traveling_salesperson.sort.tsp_sort(positions, start=0, epsilon=0.01, return_path_length=False)¶
- Parameters
- positions: 2darray
Positions array, size n x 2
- start_index: int or two-tuple
starting index as int or two-tuple of x, y position to start the path from.
- Returns
- sorted_positions: 2darray
Positions array sorted by the optimized route, size n x 2