<commit_before>Blog

* Blog about examples
* Blog about computational stability

Next release

* Undirected graphs
** With Brandes' algorithm
* Louvain algorithm
* IndexedSubSet backed by BitSet

* Subgraph representation
* Semiring algorithm - create label graph methods for label-less directed graphs, undirected graphs.
* Dijkstra's and Brandes - fill heap as nodes become reachable to reduce the heap's average complexity<commit_msg>Updated todo<commit_after>This release

* Undirected graphs
** With Brandes' algorithm
* Semiring algorithm - create label graph methods for label-less directed graphs, undirected graphs.


Next release

* Louvain algorithm
* IndexedSubSet backed by BitSet

* Subgraph representation
* Dijkstra's and Brandes - fill heap as nodes become reachable to reduce the heap's average complexity

Blog

* Blog about examples
* Blog about computational stability
{'fraction_non_alphanumeric': 0.047244094488188976, 'fraction_numerical': 0.0, 'mean_word_length': 5.223776223776224, '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': '2286826', 'n_tokens_mistral': 230, 'n_tokens_neox': 216, 'n_words': 102}