<commit_before># Simple mesh examples

A small collection of algorithms that runs on a graphs and can aid to find to routing scheme.
The examples are run by replacing (node.js)[src/node.js] with the content of the linked file. 


* [Max number consensus](src/node_max_num_consensus.js)
* [Distance enumeration](src/node_distance_enumeration.js)
<commit_msg>fix text<commit_after># Simple mesh examples

A small collection of algorithms that runs on graphs and can aid to find new routing schemes.
The examples can be run by replacing (node.js)[src/node.js] with the content of the linked files below:


* [Max number consensus](src/node_max_num_consensus.js)
* [Distance enumeration](src/node_distance_enumeration.js)

{'fraction_non_alphanumeric': 0.07520891364902507, 'fraction_numerical': 0.0, 'mean_word_length': 5.3628318584070795, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, '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}}
{'dir': 'git-commits-cleaned', 'id': '3354609', 'n_tokens_mistral': 208, 'n_tokens_neox': 198, 'n_words': 84}