<commit_before>Things to do
============

* Prim's algorithm
* More formulas for geometry, trigonometry, сombinatorics, number theory (sum of divisors to the i-th power, number of integers less than n relatively prime to n, ...)
* Edmonds's maximum matching algorithm
* Implement lazy range update in Segment Tree
* Interval Tree
* Hungarian algorithm
* Suffix arrays (fast construction and some example uses. also LCP array)
* Sweeping line algorithm for finding the pair of intersecting segments in a set of segments
* Simplex method
* Articulation points and bridges in a graph (similar to Tarjan's SCC algorithm)
* Find Lexicographically minimal string rotation (perhaps using Duval's algorithm)
* Add more Geometry stuff. Point in polygon, cutting polygons, etc.
* Implement a faster version of min-cost max-flow using Dijkstra's algorithm + Johnson's algorithm (or maybe even implement Dinic's algorithm)
* Make nicer interface to AVL Tree/Map (add iterators and hide pointers)
* Do field testing on more of the code ((Min-Cost) Max-Flow, geometry library)
* Edmond's optimum branching algorithm

Links
=====

* [List of Algorithms 1](http://translate.google.com/translate?prev=hp&hl=en&js=y&u=http%3A%2F%2Finfoarena.ro%2Ftraining-path&sl=ro&tl=en&history_state0=)
* [List of Algorithms 2](http://translate.googleusercontent.com/translate_c?depth=1&hl=en&prev=hp&rurl=translate.google.com&sl=ro&tl=en&twu=1&u=http://www.scribd.com/doc/58361421/Programming-Camp-Syllabus&usg=ALkJrhhoVa_NFY8wuM547awYV-fnA3Pi8w)
* [List of Algorithms 3](http://translate.google.com/translate?sl=auto&tl=en&js=n&prev=_t&hl=en&ie=UTF-8&eotf=1&u=http%3A%2F%2Fe-maxx.ru%2Falgo%2F&act=url)
* [The IOI syllabus](http://people.ksp.sk/~misof//ioi-syllabus/)
* [TopCoder Algorithm tutorials](http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=lineSweep)
* [The Linear Congruence Theorem](http://en.wikipedia.org/wiki/Linear_congruence_theorem)
* [Heron's formula](http://en.wikipedia.org/wiki/Heron's_formula)
* [Shanks Algorithm](http://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm)
* [I<NAME>'s code library](http://shygypsy.com/tools/)
* [Julian Day](https://en.wikipedia.org/wiki/Julian_day)<commit_msg>Updated TODO.<commit_after>Things to do
============

* Ternary search
* Prim's algorithm
* More formulas for geometry, trigonometry, сombinatorics, number theory (sum of divisors to the i-th power, number of integers less than n relatively prime to n, ...)
* Edmonds's maximum matching algorithm
* Implement lazy range update in Segment Tree
* Interval Tree
* Hungarian algorithm
* Suffix arrays (fast construction and some example uses, also LCP array)
* Sweeping line algorithm for finding the pair of intersecting segments in a set of segments
* Simplex method
* Articulation points and bridges in a graph (similar to Tarjan's SCC algorithm)
* Find Lexicographically minimal string rotation (perhaps using Duval's algorithm)
* Add more Geometry stuff. Point in polygon, etc.
* Implement a faster version of min-cost max-flow using Dijkstra's algorithm + Johnson's algorithm (or maybe even implement Dinic's algorithm)
* Do field testing on more of the code (Min-Cost Max-Flow)
* Edmond's optimum branching algorithm

Links
=====

* [List of Algorithms 1](http://translate.google.com/translate?prev=hp&hl=en&js=y&u=http%3A%2F%2Finfoarena.ro%2Ftraining-path&sl=ro&tl=en&history_state0=)
* [List of Algorithms 2](http://translate.googleusercontent.com/translate_c?depth=1&hl=en&prev=hp&rurl=translate.google.com&sl=ro&tl=en&twu=1&u=http://www.scribd.com/doc/58361421/Programming-Camp-Syllabus&usg=ALkJrhhoVa_NFY8wuM547awYV-fnA3Pi8w)
* [List of Algorithms 3](http://translate.google.com/translate?sl=auto&tl=en&js=n&prev=_t&hl=en&ie=UTF-8&eotf=1&u=http%3A%2F%2Fe-maxx.ru%2Falgo%2F&act=url)
* [The IOI syllabus](http://people.ksp.sk/~misof//ioi-syllabus/)
* [TopCoder Algorithm tutorials](http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=lineSweep)
* [The Linear Congruence Theorem](http://en.wikipedia.org/wiki/Linear_congruence_theorem)
* [Heron's formula](http://en.wikipedia.org/wiki/Heron's_formula)
* [Shanks Algorithm](http://en.wikipedia.org/wiki/Tonelli%E2%80%93Shanks_algorithm)
* [Igor Naverniouk's code library](http://shygypsy.com/tools/)
* [Julian Day](https://en.wikipedia.org/wiki/Julian_day)
* [infnty/acm at github](https://github.com/infnty/acm/tree/master/lib)
{'fraction_non_alphanumeric': 0.13386363636363635, 'fraction_numerical': 0.017272727272727273, 'mean_word_length': 6.310631229235881, 'pattern_counts': {'":': 0, '<': 4, '<?xml version=': 0, '>': 4, 'https://': 3, 'lorem ipsum': 0, 'www.': 2, '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': '2900094', 'n_tokens_mistral': 1592, 'n_tokens_neox': 1482, 'n_words': 353}