<commit_before>Hungarian algorithm:
    finds in a weighted bipartite graph, a matching of a given size, in which the 
    sum of weights of the edges is minimum.
    a.k.a. Maximum Weighted Maximum Cardinality Bipartite Matching
    runtime complexity O(mn + n^2(log n)), where n := |X| = |Y | and m := |E|
    thirdparty.algorithm.HungarianAlgorithm.java

Jonker–Volgenant
    A solver for the min-cost, balanced, weighted bipartite assignment problem
    runtime complexity O(n^3), where n := |X| = |Y | and m := |E|

Min-cost unbalanced assignment:
    A solver for the min-cost, unbalanced, weighted bipartite
    assignment problem that uses weight scaling
    to solve the perfect and imperfect
    assignment problems, but not incremental<commit_msg>editing the assignment problem notes.<commit_after>Hungarian algorithm:
    finds in a weighted bipartite graph, a matching of a given size, in which the 
    sum of weights of the edges is minimum.
    a.k.a. Maximum Weighted Maximum Cardinality Bipartite Matching
**revisit this: the runtime complexity might be the tarjan revision of it:
    runtime complexity O(mn + n^2(log n)), where n := |X| = |Y | and m := |E|
    thirdparty.algorithm.HungarianAlgorithm.java

Jonker–Volgenant
    A solver for the min-cost, balanced, weighted bipartite assignment problem
    runtime complexity O(n^3), where n := |X| = |Y | and m := |E|

Min-cost unbalanced assignment:
    A solver for the min-cost, unbalanced, weighted bipartite
    assignment problem that uses weight scaling
    to solve the perfect and imperfect
    assignment problems, but not incremental
{'fraction_non_alphanumeric': 0.07244582043343653, 'fraction_numerical': 0.002476780185758514, 'mean_word_length': 3.8095238095238093, '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': '6717539', 'n_tokens_mistral': 472, 'n_tokens_neox': 433, 'n_words': 203}