{'fraction_non_alphanumeric': 0.01791044776119403, 'fraction_numerical': 0.0, 'mean_word_length': 4.014925373134329, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Sequence of maximal distance codes in graphs or other metric spaces

Given a subset C in a metric space E , its successor is the subset  s ( C ) of points at maximum distance from C in E . We study some properties of the sequence obtained by iterating this operation.  Graphs with their usual distance provide already typical examples.