GreedyPermutation

A full greedy permutation (farthest-point / "maxmin" sampling) of an ENTIRE finite metric space -- as opposed to streams.LandmarkSelection, which picks a SUBSET. order is every ambient index in selection order (order(0) is the seed point); insertionRadius(p) is p's own lambda_p = d(p, {points ordered before p}), with insertionRadius(order(0)) = Double.PositiveInfinity by convention (there is no "distance to the empty set", and the seed point must never be pruned away by any downstream sparsification). Built by LandmarkSelector.maxmin run to numLandmarks = metricSpace.size (see that method's own doc) -- this type just names the result's intended use (SheehyRipsSimplexStream) distinctly from a landmark subset.