namespace greedy_algorithms for std::vector for string class namespace greedy_algorithms::dijkstra Functions for the Dijkstra algorithm implementation.
binary_addition.cpp Adds two binary numbers and outputs resulting string. boruvkas_minimum_spanning_tree.cpp [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm ) to find the Minimum Spanning Tree linear_search.cpp Linear search algorithm Longest_Increasing_Subsequence_using_binary_search.cpp find the length of the Longest Increasing Subsequence (LIS) using Binary Search longest_increasing_subsequence_using_binary_search.cpp find the length of the Longest Increasing Subsequence (LIS) using Binary Search median_search.cpp Implementation of Median search algorithm. @cases from here ► graphics spirograph.cpp Implementation of Spirograph ► greedy_algorithms boruvkas_minimum_spanning_tree.cpp [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm ) to find the Minimum Spanning Tree digit_separation.cpp Separates digits from numbers in forward and reverse order dijkstra.cpp Dijkstra algorithm implementation gale_shapley.cpp Gale Shapley Algorithm jump_game.cpp Jumping Game algorithm implementation kruskals_minimum_spanning_tree.cpp Kruskals Minimum Spanning Tree implementation binary_addition.cpp Adds two binary numbers and outputs resulting string boruvkas_minimum_spanning_tree.cpp [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm ) to find the Minimum Spanning Tree digit_separation.cpp Separates digits from numbers in forward and reverse order dijkstra.cpp Dijkstra algorithm implementation gale_shapley.cpp Gale Shapley Algorithm jump_game.cpp Jumping Game algorithm implementation kruskals_minimum_spanning_tree.cpp Kruskals Minimum Spanning Tree implementation ► hashing chaining.cpp Implementation of hash chains double_hash_hash_table.cpp Storage mechanism using double-hashed keys interpolation_search2.cpp Interpolation search algorithm jump_search.cpp C++ program to implement Jump Search linear_search.cpp Linear search algorithm Longest_Increasing_Subsequence_using_binary_search.cpp Find the length of the Longest Increasing Subsequence (LIS) using Binary Search longest_increasing_subsequence_using_binary_search.cpp Find the length of the Longest Increasing Subsequence (LIS) using Binary Search median_search.cpp Implementation of Median search algorithm. @cases from here median_search2.cpp Given a linked list L[0,....,n] of n numbers, find the middle node saddleback_search.cpp Implementation of Saddleback Algorithm for 2D arrays add() : data_structures::Bitset , data_structures::BloomFilter< T > , hash_chain , operations_on_datastructures::reverse_binary_tree::BinaryTree
add_digit() : large_number
add_edge() : graph::Graph< T > , greedy_algorithms::dijkstra::Graph , range_queries::heavy_light_decomposition::Tree< X >
+addBinary() : greedy_algorithms::BinaryAddition
addEdge() : Graph , graph::HKGraph , graph::is_graph_bipartite::Graph
addProcess() : FCFS< S, T, E >
addVertices() : Graph
diff --git a/functions_func_a.html b/functions_func_a.html
index 42d284a8a..7dee571ca 100644
--- a/functions_func_a.html
+++ b/functions_func_a.html
@@ -114,6 +114,7 @@ $(function(){initNavTree('functions_func_a.html',''); initResizable(true); });
add() : data_structures::Bitset , data_structures::BloomFilter< T > , hash_chain , operations_on_datastructures::reverse_binary_tree::BinaryTree
add_digit() : large_number
add_edge() : graph::Graph< T > , greedy_algorithms::dijkstra::Graph , range_queries::heavy_light_decomposition::Tree< X >
+addBinary() : greedy_algorithms::BinaryAddition
addEdge() : Graph , graph::HKGraph , graph::is_graph_bipartite::Graph
addProcess() : FCFS< S, T, E >
addVertices() : Graph
diff --git a/functions_func_i.html b/functions_func_i.html
index ff4aace11..ba0145b1b 100644
--- a/functions_func_i.html
+++ b/functions_func_i.html
@@ -135,6 +135,7 @@ $(function(){initNavTree('functions_func_i.html',''); initResizable(true); });
IsFull() : data_structures::tree_234::Node
IsLeaf() : data_structures::tree_234::Node
isSame() : dsu
+isValidBinaryString() : greedy_algorithms::BinaryAddition
diff --git a/functions_i.html b/functions_i.html
index 7f9201087..4a448f4e8 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -137,6 +137,7 @@ $(function(){initNavTree('functions_i.html',''); initResizable(true); });
IsFull() : data_structures::tree_234::Node
IsLeaf() : data_structures::tree_234::Node
isSame() : dsu
+isValidBinaryString() : greedy_algorithms::BinaryAddition
items : data_structures::tree_234::Node
diff --git a/globals_func_l.html b/globals_func_l.html
index 93858e0ca..5ec0a4e4f 100644
--- a/globals_func_l.html
+++ b/globals_func_l.html
@@ -113,7 +113,7 @@ $(function(){initNavTree('globals_func_l.html',''); initResizable(true); });
levelOrder() : avltree.cpp
LinearSearch() : linear_search.cpp
longest_common_string_length() : longest_common_string.cpp
-longest_increasing_subsequence_using_binary_search() : Longest_Increasing_Subsequence_using_binary_search.cpp
+longest_increasing_subsequence_using_binary_search() : longest_increasing_subsequence_using_binary_search.cpp
lower() : text_search.cpp
lu_decomposition() : lu_decomposition.h
diff --git a/globals_func_m.html b/globals_func_m.html
index 937b33d2f..3f0974860 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -107,7 +107,7 @@ $(function(){initNavTree('globals_func_m.html',''); initResizable(true); });
Here is a list of all documented functions with links to the documentation:
-main() : generate_parentheses.cpp , graph_coloring.cpp , knight_tour.cpp , minimax.cpp , n_queens.cpp , n_queens_all_solution_optimised.cpp , nqueen_print_all_solutions.cpp , rat_maze.cpp , subarray_sum.cpp , subset_sum.cpp , sudoku_solver.cpp , wildcard_matching.cpp , count_bits_flip.cpp , count_of_set_bits.cpp , count_of_trailing_ciphers_in_factorial_n.cpp , find_non_repeating_number.cpp , hamming_distance.cpp , next_higher_number_with_same_number_of_set_bits.cpp , power_of_2.cpp , set_kth_bit.cpp , travelling_salesman_using_bit_manipulation.cpp , a1z26_cipher.cpp , atbash_cipher.cpp , caesar_cipher.cpp , elliptic_curve_key_exchange.cpp , hill_cipher.cpp , morse_code.cpp , vigenere_cipher.cpp , xor_cipher.cpp , fcfs_scheduling.cpp , avltree.cpp , bloom_filter.cpp , disjoint_set.cpp , dsu_path_compression.cpp , dsu_union_rank.cpp , linked_list.cpp , linkedlist_implentation_usingarray.cpp , list_array.cpp , queue_using_array.cpp , queue_using_two_stacks.cpp , reverse_a_linked_list.cpp , segment_tree.cpp , skip_list.cpp , sparse_table.cpp , treap.cpp , tree_234.cpp , trie_modern.cpp , trie_tree.cpp , trie_using_hashmap.cpp , karatsuba_algorithm_for_fast_multiplication.cpp , 0_1_knapsack.cpp , abbreviation.cpp , armstrong_number.cpp , coin_change_topdown.cpp , cut_rod.cpp , house_robber.cpp , kadane2.cpp , longest_common_string.cpp , longest_increasing_subsequence.cpp , longest_palindromic_subsequence.cpp , maximum_circular_subarray.cpp , minimum_edit_distance.cpp , palindrome_partitioning.cpp , shortest_common_supersequence.cpp , subset_sum.cpp , trapped_rainwater.cpp , word_break.cpp , memory_game.cpp , jarvis_algorithm.cpp , line_segment_intersection.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , connected_components_with_dsu.cpp , depth_first_search.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hamiltons_cycle.cpp , hopcroft_karp.cpp , is_graph_bipartite.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , spirograph.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , jump_game.cpp , kruskals_minimum_spanning_tree.cpp , chaining.cpp , double_hash_hash_table.cpp , linear_probing_hash_table.cpp , md5.cpp , quadratic_probing_hash_table.cpp , sha1.cpp , sha256.cpp , adaline_learning.cpp , k_nearest_neighbors.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp , neural_network.cpp , ordinary_least_squares_regressor.cpp , aliquot_sum.cpp , approximate_pi.cpp , area.cpp , binary_exponent.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , eratosthenes.cpp , eulers_totient_function.cpp , extended_euclid_algorithm.cpp , factorial.cpp , fast_power.cpp , fibonacci.cpp , fibonacci_fast.cpp , fibonacci_matrix_exponentiation.cpp , fibonacci_sum.cpp , finding_number_of_digits_in_a_number.cpp , gcd_iterative_euclidean.cpp , gcd_of_n_numbers.cpp , gcd_recursive_euclidean.cpp , integral_approximation.cpp , integral_approximation2.cpp , inv_sqrt.cpp , iterative_factorial.cpp , large_factorial.cpp , largest_power.cpp , lcm_sum.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , modular_division.cpp , modular_exponentiation.cpp , modular_inverse_fermat_little_theorem.cpp , modular_inverse_simple.cpp , n_bonacci.cpp , n_choose_r.cpp , number_of_positive_divisors.cpp , perimeter.cpp , power_for_huge_numbers.cpp , power_of_two.cpp , prime_factorization.cpp , prime_numbers.cpp , primes_up_to_billion.cpp , quadratic_equations_complex_numbers.cpp , realtime_stats.cpp , sieve_of_eratosthenes.cpp , sqrt_double.cpp , string_fibonacci.cpp , sum_of_binomial_coefficient.cpp , sum_of_digits.cpp , vector_cross_product.cpp , volume.cpp , babylonian_method.cpp , bisection_method.cpp , brent_method_extrema.cpp , composite_simpson_rule.cpp , false_position.cpp , fast_fourier_transform.cpp , gaussian_elimination.cpp , golden_search_extrema.cpp , gram_schmidt.cpp , inverse_fast_fourier_transform.cpp , lu_decompose.cpp , midpoint_integral_method.cpp , newton_raphson_method.cpp , ode_forward_euler.cpp , ode_midpoint_euler.cpp , ode_semi_implicit_euler.cpp , qr_decomposition.cpp , qr_eigen_values.cpp , rungekutta.cpp , successive_approximation.cpp , array_left_rotation.cpp , array_right_rotation.cpp , circular_linked_list.cpp , inorder_successor_of_bst.cpp , intersection_of_two_arrays.cpp , reverse_binary_tree.cpp , trie_multiple_search.cpp , union_of_two_arrays.cpp , buzz_number.cpp , decimal_to_hexadecimal.cpp , decimal_to_roman_numeral.cpp , fast_integer_input.cpp , happy_number.cpp , iterative_tree_traversals.cpp , kadanes3.cpp , kelvin_to_celsius.cpp , lfu_cache.cpp , longest_substring_without_repeating_characters.cpp , lru_cache.cpp , lru_cache2.cpp , matrix_exponentiation.cpp , palindrome_of_number.cpp , pascal_triangle.cpp , postfix_evaluation.cpp , primality_test.cpp , recursive_tree_traversal.cpp , smallest_circle.cpp , sparse_matrix.cpp , spiral_print.cpp , stairs_pattern.cpp , tower_of_hanoi.cpp , vector_important_functions.cpp , ground_to_ground_projectile_motion.cpp , addition_rule.cpp , bayes_theorem.cpp , binomial_dist.cpp , exponential_dist.cpp , geometric_dist.cpp , poisson_dist.cpp , windowed_median.cpp , fenwick_tree.cpp , heavy_light_decomposition.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , segtree.cpp , sparse_table.cpp , exponential_search.cpp , fibonacci_search.cpp , floyd_cycle_detection_algo.cpp , hash_search.cpp , interpolation_search2.cpp , linear_search.cpp , Longest_Increasing_Subsequence_using_binary_search.cpp , median_search.cpp , median_search2.cpp , saddleback_search.cpp , sublist_search.cpp , ternary_search.cpp , text_search.cpp , binary_insertion_sort.cpp , bogo_sort.cpp , bubble_sort.cpp , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , random_pivot_quick_sort.cpp , recursive_bubble_sort.cpp , selection_sort_recursive.cpp , shell_sort2.cpp , stooge_sort.cpp , strand_sort.cpp , wave_sort.cpp , boyer_moore.cpp , brute_force_string_searching.cpp , duval.cpp , horspool.cpp , manacher_algorithm.cpp , rabin_karp.cpp , z_function.cpp
+main() : generate_parentheses.cpp , graph_coloring.cpp , knight_tour.cpp , minimax.cpp , n_queens.cpp , n_queens_all_solution_optimised.cpp , nqueen_print_all_solutions.cpp , rat_maze.cpp , subarray_sum.cpp , subset_sum.cpp , sudoku_solver.cpp , wildcard_matching.cpp , count_bits_flip.cpp , count_of_set_bits.cpp , count_of_trailing_ciphers_in_factorial_n.cpp , find_non_repeating_number.cpp , hamming_distance.cpp , next_higher_number_with_same_number_of_set_bits.cpp , power_of_2.cpp , set_kth_bit.cpp , travelling_salesman_using_bit_manipulation.cpp , a1z26_cipher.cpp , atbash_cipher.cpp , caesar_cipher.cpp , elliptic_curve_key_exchange.cpp , hill_cipher.cpp , morse_code.cpp , vigenere_cipher.cpp , xor_cipher.cpp , fcfs_scheduling.cpp , avltree.cpp , bloom_filter.cpp , disjoint_set.cpp , dsu_path_compression.cpp , dsu_union_rank.cpp , linked_list.cpp , linkedlist_implentation_usingarray.cpp , list_array.cpp , queue_using_array.cpp , queue_using_two_stacks.cpp , reverse_a_linked_list.cpp , segment_tree.cpp , skip_list.cpp , sparse_table.cpp , treap.cpp , tree_234.cpp , trie_modern.cpp , trie_tree.cpp , trie_using_hashmap.cpp , karatsuba_algorithm_for_fast_multiplication.cpp , 0_1_knapsack.cpp , abbreviation.cpp , armstrong_number.cpp , coin_change_topdown.cpp , cut_rod.cpp , house_robber.cpp , kadane2.cpp , longest_common_string.cpp , longest_increasing_subsequence.cpp , longest_palindromic_subsequence.cpp , maximum_circular_subarray.cpp , minimum_edit_distance.cpp , palindrome_partitioning.cpp , shortest_common_supersequence.cpp , subset_sum.cpp , trapped_rainwater.cpp , word_break.cpp , memory_game.cpp , jarvis_algorithm.cpp , line_segment_intersection.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , connected_components_with_dsu.cpp , depth_first_search.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hamiltons_cycle.cpp , hopcroft_karp.cpp , is_graph_bipartite.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , spirograph.cpp , binary_addition.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , jump_game.cpp , kruskals_minimum_spanning_tree.cpp , chaining.cpp , double_hash_hash_table.cpp , linear_probing_hash_table.cpp , md5.cpp , quadratic_probing_hash_table.cpp , sha1.cpp , sha256.cpp , adaline_learning.cpp , k_nearest_neighbors.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp , neural_network.cpp , ordinary_least_squares_regressor.cpp , aliquot_sum.cpp , approximate_pi.cpp , area.cpp , binary_exponent.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , eratosthenes.cpp , eulers_totient_function.cpp , extended_euclid_algorithm.cpp , factorial.cpp , fast_power.cpp , fibonacci.cpp , fibonacci_fast.cpp , fibonacci_matrix_exponentiation.cpp , fibonacci_sum.cpp , finding_number_of_digits_in_a_number.cpp , gcd_iterative_euclidean.cpp , gcd_of_n_numbers.cpp , gcd_recursive_euclidean.cpp , integral_approximation.cpp , integral_approximation2.cpp , inv_sqrt.cpp , iterative_factorial.cpp , large_factorial.cpp , largest_power.cpp , lcm_sum.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , modular_division.cpp , modular_exponentiation.cpp , modular_inverse_fermat_little_theorem.cpp , modular_inverse_simple.cpp , n_bonacci.cpp , n_choose_r.cpp , number_of_positive_divisors.cpp , perimeter.cpp , power_for_huge_numbers.cpp , power_of_two.cpp , prime_factorization.cpp , prime_numbers.cpp , primes_up_to_billion.cpp , quadratic_equations_complex_numbers.cpp , realtime_stats.cpp , sieve_of_eratosthenes.cpp , sqrt_double.cpp , string_fibonacci.cpp , sum_of_binomial_coefficient.cpp , sum_of_digits.cpp , vector_cross_product.cpp , volume.cpp , babylonian_method.cpp , bisection_method.cpp , brent_method_extrema.cpp , composite_simpson_rule.cpp , false_position.cpp , fast_fourier_transform.cpp , gaussian_elimination.cpp , golden_search_extrema.cpp , gram_schmidt.cpp , inverse_fast_fourier_transform.cpp , lu_decompose.cpp , midpoint_integral_method.cpp , newton_raphson_method.cpp , ode_forward_euler.cpp , ode_midpoint_euler.cpp , ode_semi_implicit_euler.cpp , qr_decomposition.cpp , qr_eigen_values.cpp , rungekutta.cpp , successive_approximation.cpp , array_left_rotation.cpp , array_right_rotation.cpp , circular_linked_list.cpp , inorder_successor_of_bst.cpp , intersection_of_two_arrays.cpp , reverse_binary_tree.cpp , trie_multiple_search.cpp , union_of_two_arrays.cpp , buzz_number.cpp , decimal_to_hexadecimal.cpp , decimal_to_roman_numeral.cpp , fast_integer_input.cpp , happy_number.cpp , iterative_tree_traversals.cpp , kadanes3.cpp , kelvin_to_celsius.cpp , lfu_cache.cpp , longest_substring_without_repeating_characters.cpp , lru_cache.cpp , lru_cache2.cpp , matrix_exponentiation.cpp , palindrome_of_number.cpp , pascal_triangle.cpp , postfix_evaluation.cpp , primality_test.cpp , recursive_tree_traversal.cpp , smallest_circle.cpp , sparse_matrix.cpp , spiral_print.cpp , stairs_pattern.cpp , tower_of_hanoi.cpp , vector_important_functions.cpp , ground_to_ground_projectile_motion.cpp , addition_rule.cpp , bayes_theorem.cpp , binomial_dist.cpp , exponential_dist.cpp , geometric_dist.cpp , poisson_dist.cpp , windowed_median.cpp , fenwick_tree.cpp , heavy_light_decomposition.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , segtree.cpp , sparse_table.cpp , exponential_search.cpp , fibonacci_search.cpp , floyd_cycle_detection_algo.cpp , hash_search.cpp , interpolation_search2.cpp , linear_search.cpp , longest_increasing_subsequence_using_binary_search.cpp , median_search.cpp , median_search2.cpp , saddleback_search.cpp , sublist_search.cpp , ternary_search.cpp , text_search.cpp , binary_insertion_sort.cpp , bogo_sort.cpp , bubble_sort.cpp , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , random_pivot_quick_sort.cpp , recursive_bubble_sort.cpp , selection_sort_recursive.cpp , shell_sort2.cpp , stooge_sort.cpp , strand_sort.cpp , wave_sort.cpp , boyer_moore.cpp , brute_force_string_searching.cpp , duval.cpp , horspool.cpp , manacher_algorithm.cpp , rabin_karp.cpp , z_function.cpp
mat_mul() : qr_eigen_values.cpp
max_subarray_sum() : kadanes3.cpp
merge() : merge_sort.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index b11b6d4f2..edd8b1470 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -145,7 +145,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });
test_longest_common_string_length_for_reversed_inputs() : longest_common_string.cpp
test_longest_common_string_length_is_symmetric() : longest_common_string.cpp
test_remove() : binary_search_tree2.cpp
-tests() : armstrong_number.cpp , longest_common_string.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hopcroft_karp.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , approximate_pi.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , factorial.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , ncr_modulo_p.cpp , number_of_positive_divisors.cpp , sieve_of_eratosthenes.cpp , kelvin_to_celsius.cpp , longest_substring_without_repeating_characters.cpp , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , Longest_Increasing_Subsequence_using_binary_search.cpp , comb_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , quick_sort.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , boyer_moore.cpp , knuth_morris_pratt.cpp
+tests() : armstrong_number.cpp , longest_common_string.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hopcroft_karp.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , binary_addition.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , approximate_pi.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , factorial.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , ncr_modulo_p.cpp , number_of_positive_divisors.cpp , sieve_of_eratosthenes.cpp , kelvin_to_celsius.cpp , longest_substring_without_repeating_characters.cpp , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , longest_increasing_subsequence_using_binary_search.cpp , comb_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , quick_sort.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , boyer_moore.cpp , knuth_morris_pratt.cpp
TH() : tower_of_hanoi.cpp
tolowerRoman() : decimal_to_roman_numeral.cpp
toupperRoman() : decimal_to_roman_numeral.cpp
diff --git a/globals_l.html b/globals_l.html
index 59cf96df4..b4f900e23 100644
--- a/globals_l.html
+++ b/globals_l.html
@@ -116,7 +116,7 @@ $(function(){initNavTree('globals_l.html',''); initResizable(true); });
link : hash_search.cpp
ll : matrix_exponentiation.cpp
longest_common_string_length() : longest_common_string.cpp
-longest_increasing_subsequence_using_binary_search() : Longest_Increasing_Subsequence_using_binary_search.cpp
+longest_increasing_subsequence_using_binary_search() : longest_increasing_subsequence_using_binary_search.cpp
lower() : text_search.cpp
lu_decomposition() : lu_decomposition.h
diff --git a/globals_m.html b/globals_m.html
index fdd55fa0a..8a0439d3f 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -107,7 +107,7 @@ $(function(){initNavTree('globals_m.html',''); initResizable(true); });
Here is a list of all documented file members with links to the documentation:
-main() : generate_parentheses.cpp , graph_coloring.cpp , knight_tour.cpp , minimax.cpp , n_queens.cpp , n_queens_all_solution_optimised.cpp , nqueen_print_all_solutions.cpp , rat_maze.cpp , subarray_sum.cpp , subset_sum.cpp , sudoku_solver.cpp , wildcard_matching.cpp , count_bits_flip.cpp , count_of_set_bits.cpp , count_of_trailing_ciphers_in_factorial_n.cpp , find_non_repeating_number.cpp , hamming_distance.cpp , next_higher_number_with_same_number_of_set_bits.cpp , power_of_2.cpp , set_kth_bit.cpp , travelling_salesman_using_bit_manipulation.cpp , a1z26_cipher.cpp , atbash_cipher.cpp , caesar_cipher.cpp , elliptic_curve_key_exchange.cpp , hill_cipher.cpp , morse_code.cpp , vigenere_cipher.cpp , xor_cipher.cpp , fcfs_scheduling.cpp , avltree.cpp , bloom_filter.cpp , disjoint_set.cpp , dsu_path_compression.cpp , dsu_union_rank.cpp , linked_list.cpp , linkedlist_implentation_usingarray.cpp , list_array.cpp , queue_using_array.cpp , queue_using_two_stacks.cpp , reverse_a_linked_list.cpp , segment_tree.cpp , skip_list.cpp , sparse_table.cpp , treap.cpp , tree_234.cpp , trie_modern.cpp , trie_tree.cpp , trie_using_hashmap.cpp , karatsuba_algorithm_for_fast_multiplication.cpp , 0_1_knapsack.cpp , abbreviation.cpp , armstrong_number.cpp , coin_change_topdown.cpp , cut_rod.cpp , house_robber.cpp , kadane2.cpp , longest_common_string.cpp , longest_increasing_subsequence.cpp , longest_palindromic_subsequence.cpp , maximum_circular_subarray.cpp , minimum_edit_distance.cpp , palindrome_partitioning.cpp , shortest_common_supersequence.cpp , subset_sum.cpp , trapped_rainwater.cpp , word_break.cpp , memory_game.cpp , jarvis_algorithm.cpp , line_segment_intersection.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , connected_components_with_dsu.cpp , depth_first_search.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hamiltons_cycle.cpp , hopcroft_karp.cpp , is_graph_bipartite.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , spirograph.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , jump_game.cpp , kruskals_minimum_spanning_tree.cpp , chaining.cpp , double_hash_hash_table.cpp , linear_probing_hash_table.cpp , md5.cpp , quadratic_probing_hash_table.cpp , sha1.cpp , sha256.cpp , adaline_learning.cpp , k_nearest_neighbors.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp , neural_network.cpp , ordinary_least_squares_regressor.cpp , aliquot_sum.cpp , approximate_pi.cpp , area.cpp , binary_exponent.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , eratosthenes.cpp , eulers_totient_function.cpp , extended_euclid_algorithm.cpp , factorial.cpp , fast_power.cpp , fibonacci.cpp , fibonacci_fast.cpp , fibonacci_matrix_exponentiation.cpp , fibonacci_sum.cpp , finding_number_of_digits_in_a_number.cpp , gcd_iterative_euclidean.cpp , gcd_of_n_numbers.cpp , gcd_recursive_euclidean.cpp , integral_approximation.cpp , integral_approximation2.cpp , inv_sqrt.cpp , iterative_factorial.cpp , large_factorial.cpp , largest_power.cpp , lcm_sum.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , modular_division.cpp , modular_exponentiation.cpp , modular_inverse_fermat_little_theorem.cpp , modular_inverse_simple.cpp , n_bonacci.cpp , n_choose_r.cpp , number_of_positive_divisors.cpp , perimeter.cpp , power_for_huge_numbers.cpp , power_of_two.cpp , prime_factorization.cpp , prime_numbers.cpp , primes_up_to_billion.cpp , quadratic_equations_complex_numbers.cpp , realtime_stats.cpp , sieve_of_eratosthenes.cpp , sqrt_double.cpp , string_fibonacci.cpp , sum_of_binomial_coefficient.cpp , sum_of_digits.cpp , vector_cross_product.cpp , volume.cpp , babylonian_method.cpp , bisection_method.cpp , brent_method_extrema.cpp , composite_simpson_rule.cpp , false_position.cpp , fast_fourier_transform.cpp , gaussian_elimination.cpp , golden_search_extrema.cpp , gram_schmidt.cpp , inverse_fast_fourier_transform.cpp , lu_decompose.cpp , midpoint_integral_method.cpp , newton_raphson_method.cpp , ode_forward_euler.cpp , ode_midpoint_euler.cpp , ode_semi_implicit_euler.cpp , qr_decomposition.cpp , qr_eigen_values.cpp , rungekutta.cpp , successive_approximation.cpp , array_left_rotation.cpp , array_right_rotation.cpp , circular_linked_list.cpp , inorder_successor_of_bst.cpp , intersection_of_two_arrays.cpp , reverse_binary_tree.cpp , trie_multiple_search.cpp , union_of_two_arrays.cpp , buzz_number.cpp , decimal_to_hexadecimal.cpp , decimal_to_roman_numeral.cpp , fast_integer_input.cpp , happy_number.cpp , iterative_tree_traversals.cpp , kadanes3.cpp , kelvin_to_celsius.cpp , lfu_cache.cpp , longest_substring_without_repeating_characters.cpp , lru_cache.cpp , lru_cache2.cpp , matrix_exponentiation.cpp , palindrome_of_number.cpp , pascal_triangle.cpp , postfix_evaluation.cpp , primality_test.cpp , recursive_tree_traversal.cpp , smallest_circle.cpp , sparse_matrix.cpp , spiral_print.cpp , stairs_pattern.cpp , tower_of_hanoi.cpp , vector_important_functions.cpp , ground_to_ground_projectile_motion.cpp , addition_rule.cpp , bayes_theorem.cpp , binomial_dist.cpp , exponential_dist.cpp , geometric_dist.cpp , poisson_dist.cpp , windowed_median.cpp , fenwick_tree.cpp , heavy_light_decomposition.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , segtree.cpp , sparse_table.cpp , exponential_search.cpp , fibonacci_search.cpp , floyd_cycle_detection_algo.cpp , hash_search.cpp , interpolation_search2.cpp , linear_search.cpp , Longest_Increasing_Subsequence_using_binary_search.cpp , median_search.cpp , median_search2.cpp , saddleback_search.cpp , sublist_search.cpp , ternary_search.cpp , text_search.cpp , binary_insertion_sort.cpp , bogo_sort.cpp , bubble_sort.cpp , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , random_pivot_quick_sort.cpp , recursive_bubble_sort.cpp , selection_sort_recursive.cpp , shell_sort2.cpp , stooge_sort.cpp , strand_sort.cpp , wave_sort.cpp , boyer_moore.cpp , brute_force_string_searching.cpp , duval.cpp , horspool.cpp , manacher_algorithm.cpp , rabin_karp.cpp , z_function.cpp
+main() : generate_parentheses.cpp , graph_coloring.cpp , knight_tour.cpp , minimax.cpp , n_queens.cpp , n_queens_all_solution_optimised.cpp , nqueen_print_all_solutions.cpp , rat_maze.cpp , subarray_sum.cpp , subset_sum.cpp , sudoku_solver.cpp , wildcard_matching.cpp , count_bits_flip.cpp , count_of_set_bits.cpp , count_of_trailing_ciphers_in_factorial_n.cpp , find_non_repeating_number.cpp , hamming_distance.cpp , next_higher_number_with_same_number_of_set_bits.cpp , power_of_2.cpp , set_kth_bit.cpp , travelling_salesman_using_bit_manipulation.cpp , a1z26_cipher.cpp , atbash_cipher.cpp , caesar_cipher.cpp , elliptic_curve_key_exchange.cpp , hill_cipher.cpp , morse_code.cpp , vigenere_cipher.cpp , xor_cipher.cpp , fcfs_scheduling.cpp , avltree.cpp , bloom_filter.cpp , disjoint_set.cpp , dsu_path_compression.cpp , dsu_union_rank.cpp , linked_list.cpp , linkedlist_implentation_usingarray.cpp , list_array.cpp , queue_using_array.cpp , queue_using_two_stacks.cpp , reverse_a_linked_list.cpp , segment_tree.cpp , skip_list.cpp , sparse_table.cpp , treap.cpp , tree_234.cpp , trie_modern.cpp , trie_tree.cpp , trie_using_hashmap.cpp , karatsuba_algorithm_for_fast_multiplication.cpp , 0_1_knapsack.cpp , abbreviation.cpp , armstrong_number.cpp , coin_change_topdown.cpp , cut_rod.cpp , house_robber.cpp , kadane2.cpp , longest_common_string.cpp , longest_increasing_subsequence.cpp , longest_palindromic_subsequence.cpp , maximum_circular_subarray.cpp , minimum_edit_distance.cpp , palindrome_partitioning.cpp , shortest_common_supersequence.cpp , subset_sum.cpp , trapped_rainwater.cpp , word_break.cpp , memory_game.cpp , jarvis_algorithm.cpp , line_segment_intersection.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , connected_components_with_dsu.cpp , depth_first_search.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hamiltons_cycle.cpp , hopcroft_karp.cpp , is_graph_bipartite.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , spirograph.cpp , binary_addition.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , jump_game.cpp , kruskals_minimum_spanning_tree.cpp , chaining.cpp , double_hash_hash_table.cpp , linear_probing_hash_table.cpp , md5.cpp , quadratic_probing_hash_table.cpp , sha1.cpp , sha256.cpp , adaline_learning.cpp , k_nearest_neighbors.cpp , kohonen_som_topology.cpp , kohonen_som_trace.cpp , neural_network.cpp , ordinary_least_squares_regressor.cpp , aliquot_sum.cpp , approximate_pi.cpp , area.cpp , binary_exponent.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , eratosthenes.cpp , eulers_totient_function.cpp , extended_euclid_algorithm.cpp , factorial.cpp , fast_power.cpp , fibonacci.cpp , fibonacci_fast.cpp , fibonacci_matrix_exponentiation.cpp , fibonacci_sum.cpp , finding_number_of_digits_in_a_number.cpp , gcd_iterative_euclidean.cpp , gcd_of_n_numbers.cpp , gcd_recursive_euclidean.cpp , integral_approximation.cpp , integral_approximation2.cpp , inv_sqrt.cpp , iterative_factorial.cpp , large_factorial.cpp , largest_power.cpp , lcm_sum.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , modular_division.cpp , modular_exponentiation.cpp , modular_inverse_fermat_little_theorem.cpp , modular_inverse_simple.cpp , n_bonacci.cpp , n_choose_r.cpp , number_of_positive_divisors.cpp , perimeter.cpp , power_for_huge_numbers.cpp , power_of_two.cpp , prime_factorization.cpp , prime_numbers.cpp , primes_up_to_billion.cpp , quadratic_equations_complex_numbers.cpp , realtime_stats.cpp , sieve_of_eratosthenes.cpp , sqrt_double.cpp , string_fibonacci.cpp , sum_of_binomial_coefficient.cpp , sum_of_digits.cpp , vector_cross_product.cpp , volume.cpp , babylonian_method.cpp , bisection_method.cpp , brent_method_extrema.cpp , composite_simpson_rule.cpp , false_position.cpp , fast_fourier_transform.cpp , gaussian_elimination.cpp , golden_search_extrema.cpp , gram_schmidt.cpp , inverse_fast_fourier_transform.cpp , lu_decompose.cpp , midpoint_integral_method.cpp , newton_raphson_method.cpp , ode_forward_euler.cpp , ode_midpoint_euler.cpp , ode_semi_implicit_euler.cpp , qr_decomposition.cpp , qr_eigen_values.cpp , rungekutta.cpp , successive_approximation.cpp , array_left_rotation.cpp , array_right_rotation.cpp , circular_linked_list.cpp , inorder_successor_of_bst.cpp , intersection_of_two_arrays.cpp , reverse_binary_tree.cpp , trie_multiple_search.cpp , union_of_two_arrays.cpp , buzz_number.cpp , decimal_to_hexadecimal.cpp , decimal_to_roman_numeral.cpp , fast_integer_input.cpp , happy_number.cpp , iterative_tree_traversals.cpp , kadanes3.cpp , kelvin_to_celsius.cpp , lfu_cache.cpp , longest_substring_without_repeating_characters.cpp , lru_cache.cpp , lru_cache2.cpp , matrix_exponentiation.cpp , palindrome_of_number.cpp , pascal_triangle.cpp , postfix_evaluation.cpp , primality_test.cpp , recursive_tree_traversal.cpp , smallest_circle.cpp , sparse_matrix.cpp , spiral_print.cpp , stairs_pattern.cpp , tower_of_hanoi.cpp , vector_important_functions.cpp , ground_to_ground_projectile_motion.cpp , addition_rule.cpp , bayes_theorem.cpp , binomial_dist.cpp , exponential_dist.cpp , geometric_dist.cpp , poisson_dist.cpp , windowed_median.cpp , fenwick_tree.cpp , heavy_light_decomposition.cpp , persistent_seg_tree_lazy_prop.cpp , prefix_sum_array.cpp , segtree.cpp , sparse_table.cpp , exponential_search.cpp , fibonacci_search.cpp , floyd_cycle_detection_algo.cpp , hash_search.cpp , interpolation_search2.cpp , linear_search.cpp , longest_increasing_subsequence_using_binary_search.cpp , median_search.cpp , median_search2.cpp , saddleback_search.cpp , sublist_search.cpp , ternary_search.cpp , text_search.cpp , binary_insertion_sort.cpp , bogo_sort.cpp , bubble_sort.cpp , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , random_pivot_quick_sort.cpp , recursive_bubble_sort.cpp , selection_sort_recursive.cpp , shell_sort2.cpp , stooge_sort.cpp , strand_sort.cpp , wave_sort.cpp , boyer_moore.cpp , brute_force_string_searching.cpp , duval.cpp , horspool.cpp , manacher_algorithm.cpp , rabin_karp.cpp , z_function.cpp
mat_mul() : qr_eigen_values.cpp
mat_size : matrix_exponentiation.cpp
matrix : lu_decomposition.h
diff --git a/globals_t.html b/globals_t.html
index 8f2651919..e4ef71b69 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -146,7 +146,7 @@ $(function(){initNavTree('globals_t.html',''); initResizable(true); });
test_longest_common_string_length_is_symmetric() : longest_common_string.cpp
test_remove() : binary_search_tree2.cpp
test_set : brute_force_string_searching.cpp
-tests() : armstrong_number.cpp , longest_common_string.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hopcroft_karp.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , approximate_pi.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , factorial.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , ncr_modulo_p.cpp , number_of_positive_divisors.cpp , sieve_of_eratosthenes.cpp , kelvin_to_celsius.cpp , longest_substring_without_repeating_characters.cpp , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , Longest_Increasing_Subsequence_using_binary_search.cpp , comb_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , quick_sort.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , boyer_moore.cpp , knuth_morris_pratt.cpp
+tests() : armstrong_number.cpp , longest_common_string.cpp , bidirectional_dijkstra.cpp , breadth_first_search.cpp , connected_components.cpp , depth_first_search_with_stack.cpp , dijkstra.cpp , hopcroft_karp.cpp , lowest_common_ancestor.cpp , travelling_salesman_problem.cpp , binary_addition.cpp , boruvkas_minimum_spanning_tree.cpp , digit_separation.cpp , dijkstra.cpp , gale_shapley.cpp , approximate_pi.cpp , binomial_calculate.cpp , check_amicable_pair.cpp , check_factorial.cpp , check_prime.cpp , complex_numbers.cpp , double_factorial.cpp , factorial.cpp , least_common_multiple.cpp , magic_number.cpp , miller_rabin.cpp , ncr_modulo_p.cpp , number_of_positive_divisors.cpp , sieve_of_eratosthenes.cpp , kelvin_to_celsius.cpp , longest_substring_without_repeating_characters.cpp , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , longest_increasing_subsequence_using_binary_search.cpp , comb_sort.cpp , insertion_sort.cpp , insertion_sort_recursive.cpp , quick_sort.cpp , quick_sort_iterative.cpp , radix_sort2.cpp , boyer_moore.cpp , knuth_morris_pratt.cpp
TH() : tower_of_hanoi.cpp
tolowerRoman() : decimal_to_roman_numeral.cpp
toupperRoman() : decimal_to_roman_numeral.cpp
diff --git a/hierarchy.html b/hierarchy.html
index f80ec3459..c23f6969e 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -114,129 +114,130 @@ This inheritance list is sorted roughly, but not completely, alphabetically: C machine_learning::adaline C machine_learning::aystar_search::AyStarSearch< Puzzle > A class defining A* search algorithm . for some initial state and final state C binary_search_tree< T > The Binary Search Tree class C operations_on_datastructures::reverse_binary_tree::BinaryTree A Binary Tree class that implements a Binary Search Tree (BST) by default C others::iterative_tree_traversals::BinaryTree Defines the functions associated with the binary tree C data_structures::Bitset Simple bitset implementation for bloom filter C data_structures::BloomFilter< T > Bloom filter template class C binary_search_tree< T >::bst_node A struct to represent a node in the Binary Search Tree C others::recursive_tree_traversals::BT BT used to make the entire structure of the binary tree and the functions associated with the binary tree C Btree C catalan_numbers Computes and caches Catalan numbers C operations_on_datastructures::circular_linked_list::CircularLinkedList A class that implements a Circular Linked List C cll C Compare< S, T, E > Comparator class for priority queue C compare C machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator Custom comparator for open_list C Complex Class Complex to represent complex numbers as a field C geometry::jarvis::Convexhull C CycleCheck C others::Cache::D_Node< T > Node for a doubly linked list with data, prev and next pointers C others::Cache::D_Node< K, V > C machine_learning::neural_network::layers::DenseLayer C greedy_algorithms::DigitSeparation A class that provides methods to separate the digits of a large positive number C double_linked_list C dsu Disjoint sets union data structure, class based representation C EasterYearMonthDay For IO operations C Edge C machine_learning::aystar_search::EightPuzzle< N > A class defining EightPuzzle/15-Puzzle game C double_hashing::Entry C linear_probing::Entry C quadratic_probing::Entry C FCFS< S, T, E > Class which implements the FCFS scheduling algorithm C range_queries::fenwick_tree The class that initializes the Fenwick Tree C backtracking::generate_parentheses Generate_parentheses class C probability::geometric_dist::geometric_distribution A class to model the geometric distribution C Graph ► C graph::Graph< T > C graph::RootedTree C graph::is_graph_bipartite::Graph Class for representing graph as an adjacency list C greedy_algorithms::dijkstra::Graph Wrapper class for storing a graph C hashing::sha256::Hash Contains hash array and functions to update it and convert it to a hexadecimal string C hash_chain Chain class with a given modulus C ciphers::HillCipher Implementation of Hill Cipher algorithm C graph::HKGraph Represents Bipartite graph for Hopcroft Karp implementation C machine_learning::aystar_search::AyStarSearch< Puzzle >::Info Struct that handles all the information related to the current state C Item C machine_learning::k_nearest_neighbors::Knn K-Nearest Neighbors (Knn ) class using Euclidean distance as distance metric C large_number C others::Cache::LFUCache< K, V > LFUCache C data_structures::linked_list::link C linkedlist C data_structures::linked_list::list C data_structures::list_array::list< N > Structure of List with supporting methods C list C ListNode For IO operations C Longest_Substring Class that solves the Longest Substring Without Repeating Characters problem C graph::LowestCommonAncestor C others::Cache::LRUCache< K, V > LRUCache C others::lru_cache::LRUCache LRU cache class C divide_and_conquer::strassens_multiplication::Matrix< T, typename > Matrix class C MinHeap C MinHeapNode C mst C math::ncr_modulo_p::NCRModuloP Class which contains all methods required for calculating nCr mod p C machine_learning::neural_network::NeuralNetwork C data_structures::linked_list::Node C data_structures::Node C data_structures::tree_234::Node 2-3-4 tree node class C data_structures::trie_using_hashmap::Trie::Node Struct representing a trie node C Node< ValueType > C operations_on_datastructures::circular_linked_list::Node A Node struct that represents a single Node in a Binary Tree C operations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST C operations_on_datastructures::reverse_binary_tree::Node A Node struct that represents a single node in a Binary Tree C others::iterative_tree_traversals::Node Defines the structure of a node of the tree C others::recursive_tree_traversals::Node The structure to hold Nodes of the tree C range_queries::perSegTree::Node C search::sublist_search::Node A Node structure representing a single link Node in a linked list C node C Node< value_type > C strings::boyer_moore::pattern A structure representing all the data we need to search the preprocessed pattern in text C range_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C ciphers::elliptic_curve_key_exchange::Point Definition of struct Point C geometry::grahamscan::Point C geometry::jarvis::Point C Point C query C Queue C queue< ValueType > C data_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array C RBtree C SegmentIntersection C data_structures::SegmentTree< T > Class representation of the segment tree ► C range_queries::heavy_light_decomposition::SG< X > Segment Tree , to store heavy chains C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::SkipList C Solution C data_structures::sparse_table::Sparse_table C data_structures::Stack< T > Class representation of a stack C data_structures::stack_using_queue::Stack Stack Class implementation for basic methods of Stack Data Structure C others::postfix_expression::Stack Creates an array to be used as stack for storing values C stack< ValueType > For std::invalid_argument C stack_linkedList C statistics::stats_computer1< T > C statistics::stats_computer2< T > C TestCase Single example inputs and expected output of the function longest_common_string_length C TestCases Class encapsulating the necessary test cases C operations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them C tower C data_structures::treap::Treap Struct representation of the treap ► C range_queries::heavy_light_decomposition::Tree< X > A Basic Tree , which supports binary lifting C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::tree_234::Tree234 2-3-4 tree class C data_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix C Trie C data_structures::trie Trie implementation for small-case English alphabets a-z C Trie::TrieNode ► C std::true_type [external] C std::is_arithmetic< uint128_t > C std::is_arithmetic< uint256_t > C std::is_integral< uint128_t > C std::is_integral< uint256_t > C std::is_unsigned< uint128_t > C std::is_unsigned< uint256_t > C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer C probability::windowed_median::WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values C greedy_algorithms::BinaryAddition A class to perform binary addition of two binary strings C operations_on_datastructures::reverse_binary_tree::BinaryTree A Binary Tree class that implements a Binary Search Tree (BST) by default C others::iterative_tree_traversals::BinaryTree Defines the functions associated with the binary tree C data_structures::Bitset Simple bitset implementation for bloom filter C data_structures::BloomFilter< T > Bloom filter template class C binary_search_tree< T >::bst_node A struct to represent a node in the Binary Search Tree C others::recursive_tree_traversals::BT BT used to make the entire structure of the binary tree and the functions associated with the binary tree C Btree C catalan_numbers Computes and caches Catalan numbers C operations_on_datastructures::circular_linked_list::CircularLinkedList A class that implements a Circular Linked List C cll C Compare< S, T, E > Comparator class for priority queue C compare C machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator Custom comparator for open_list C Complex Class Complex to represent complex numbers as a field C geometry::jarvis::Convexhull C CycleCheck C others::Cache::D_Node< T > Node for a doubly linked list with data, prev and next pointers C others::Cache::D_Node< K, V > C machine_learning::neural_network::layers::DenseLayer C greedy_algorithms::DigitSeparation A class that provides methods to separate the digits of a large positive number C double_linked_list C dsu Disjoint sets union data structure, class based representation C EasterYearMonthDay For IO operations C Edge C machine_learning::aystar_search::EightPuzzle< N > A class defining EightPuzzle/15-Puzzle game C double_hashing::Entry C linear_probing::Entry C quadratic_probing::Entry C FCFS< S, T, E > Class which implements the FCFS scheduling algorithm C range_queries::fenwick_tree The class that initializes the Fenwick Tree C backtracking::generate_parentheses Generate_parentheses class C probability::geometric_dist::geometric_distribution A class to model the geometric distribution C Graph ► C graph::Graph< T > C graph::RootedTree C graph::is_graph_bipartite::Graph Class for representing graph as an adjacency list C greedy_algorithms::dijkstra::Graph Wrapper class for storing a graph C hashing::sha256::Hash Contains hash array and functions to update it and convert it to a hexadecimal string C hash_chain Chain class with a given modulus C ciphers::HillCipher Implementation of Hill Cipher algorithm C graph::HKGraph Represents Bipartite graph for Hopcroft Karp implementation C machine_learning::aystar_search::AyStarSearch< Puzzle >::Info Struct that handles all the information related to the current state C Item C machine_learning::k_nearest_neighbors::Knn K-Nearest Neighbors (Knn ) class using Euclidean distance as distance metric C large_number C others::Cache::LFUCache< K, V > LFUCache C data_structures::linked_list::link C linkedlist C data_structures::linked_list::list C data_structures::list_array::list< N > Structure of List with supporting methods C list C ListNode For IO operations C Longest_Substring Class that solves the Longest Substring Without Repeating Characters problem C graph::LowestCommonAncestor C others::Cache::LRUCache< K, V > LRUCache C others::lru_cache::LRUCache LRU cache class C divide_and_conquer::strassens_multiplication::Matrix< T, typename > Matrix class C MinHeap C MinHeapNode C mst C math::ncr_modulo_p::NCRModuloP Class which contains all methods required for calculating nCr mod p C machine_learning::neural_network::NeuralNetwork C data_structures::linked_list::Node C data_structures::Node C data_structures::tree_234::Node 2-3-4 tree node class C data_structures::trie_using_hashmap::Trie::Node Struct representing a trie node C Node< ValueType > C operations_on_datastructures::circular_linked_list::Node A Node struct that represents a single Node in a Binary Tree C operations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST C operations_on_datastructures::reverse_binary_tree::Node A Node struct that represents a single node in a Binary Tree C others::iterative_tree_traversals::Node Defines the structure of a node of the tree C others::recursive_tree_traversals::Node The structure to hold Nodes of the tree C range_queries::perSegTree::Node C search::sublist_search::Node A Node structure representing a single link Node in a linked list C node C Node< value_type > C strings::boyer_moore::pattern A structure representing all the data we need to search the preprocessed pattern in text C range_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C ciphers::elliptic_curve_key_exchange::Point Definition of struct Point C geometry::grahamscan::Point C geometry::jarvis::Point C Point C query C Queue C queue< ValueType > C data_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array C RBtree C SegmentIntersection C data_structures::SegmentTree< T > Class representation of the segment tree ► C range_queries::heavy_light_decomposition::SG< X > Segment Tree , to store heavy chains C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::SkipList C Solution C data_structures::sparse_table::Sparse_table C data_structures::Stack< T > Class representation of a stack C data_structures::stack_using_queue::Stack Stack Class implementation for basic methods of Stack Data Structure C others::postfix_expression::Stack Creates an array to be used as stack for storing values C stack< ValueType > For std::invalid_argument C stack_linkedList C statistics::stats_computer1< T > C statistics::stats_computer2< T > C TestCase Single example inputs and expected output of the function longest_common_string_length C TestCases Class encapsulating the necessary test cases C operations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them C tower C data_structures::treap::Treap Struct representation of the treap ► C range_queries::heavy_light_decomposition::Tree< X > A Basic Tree , which supports binary lifting C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::tree_234::Tree234 2-3-4 tree class C data_structures::trie_using_hashmap::Trie Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix C Trie C data_structures::trie Trie implementation for small-case English alphabets a-z C Trie::TrieNode ► C std::true_type [external] C std::is_arithmetic< uint128_t > C std::is_arithmetic< uint256_t > C std::is_integral< uint128_t > C std::is_integral< uint256_t > C std::is_unsigned< uint128_t > C std::is_unsigned< uint256_t > C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer C probability::windowed_median::WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values
diff --git a/hierarchy.js b/hierarchy.js
index 590a60c5f..871afc59a 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -3,6 +3,7 @@ var hierarchy =
[ "machine_learning::adaline", "d6/d30/classmachine__learning_1_1adaline.html", null ],
[ "machine_learning::aystar_search::AyStarSearch< Puzzle >", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html", null ],
[ "binary_search_tree< T >", "d9/dde/classbinary__search__tree.html", null ],
+ [ "greedy_algorithms::BinaryAddition", "de/df6/classgreedy__algorithms_1_1_binary_addition.html", null ],
[ "operations_on_datastructures::reverse_binary_tree::BinaryTree", "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html", null ],
[ "others::iterative_tree_traversals::BinaryTree", "d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html", null ],
[ "data_structures::Bitset", "d9/dae/classdata__structures_1_1_bitset.html", null ],
diff --git a/inherit_graph_100.map b/inherit_graph_100.map
index 1c951b834..793ef5c28 100644
--- a/inherit_graph_100.map
+++ b/inherit_graph_100.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_100.md5 b/inherit_graph_100.md5
index 9bd5c9ecc..ae285fb9b 100644
--- a/inherit_graph_100.md5
+++ b/inherit_graph_100.md5
@@ -1 +1 @@
-d1b903c12342c81b9815dc3248590328
\ No newline at end of file
+4118d46187a1c497ec1244462bb4e7d1
\ No newline at end of file
diff --git a/inherit_graph_100.svg b/inherit_graph_100.svg
index f72a056ba..fcb147c47 100644
--- a/inherit_graph_100.svg
+++ b/inherit_graph_100.svg
@@ -4,17 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-search::sublist_search
-::Node
+
+RBtree
-
diff --git a/inherit_graph_101.md5 b/inherit_graph_101.md5
index 5964d67e1..9bd5c9ecc 100644
--- a/inherit_graph_101.md5
+++ b/inherit_graph_101.md5
@@ -1 +1 @@
-ec8e0ec9ba2659ae4c1c03a14fee656f
\ No newline at end of file
+d1b903c12342c81b9815dc3248590328
\ No newline at end of file
diff --git a/inherit_graph_101.svg b/inherit_graph_101.svg
index a2b1bf90d..f72a056ba 100644
--- a/inherit_graph_101.svg
+++ b/inherit_graph_101.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-SegmentIntersection
+
+search::sublist_search
+::Node
-
diff --git a/inherit_graph_102.md5 b/inherit_graph_102.md5
index 9e4062aa2..5964d67e1 100644
--- a/inherit_graph_102.md5
+++ b/inherit_graph_102.md5
@@ -1 +1 @@
-ff0be17deb0c0dfb25090b34c2c7d14f
\ No newline at end of file
+ec8e0ec9ba2659ae4c1c03a14fee656f
\ No newline at end of file
diff --git a/inherit_graph_102.svg b/inherit_graph_102.svg
index 38f3d5fd3..a2b1bf90d 100644
--- a/inherit_graph_102.svg
+++ b/inherit_graph_102.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Solution
+
+SegmentIntersection
-
diff --git a/inherit_graph_103.md5 b/inherit_graph_103.md5
index c34364d09..9e4062aa2 100644
--- a/inherit_graph_103.md5
+++ b/inherit_graph_103.md5
@@ -1 +1 @@
-717e385118aaa4f551bc0a7a0954681d
\ No newline at end of file
+ff0be17deb0c0dfb25090b34c2c7d14f
\ No newline at end of file
diff --git a/inherit_graph_103.svg b/inherit_graph_103.svg
index a30ef46fa..38f3d5fd3 100644
--- a/inherit_graph_103.svg
+++ b/inherit_graph_103.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-stack< ValueType >
+
+Solution
-
diff --git a/inherit_graph_104.md5 b/inherit_graph_104.md5
index 8a3a7c542..c34364d09 100644
--- a/inherit_graph_104.md5
+++ b/inherit_graph_104.md5
@@ -1 +1 @@
-f583284f2e396e0f7b5fd8bccf0bb840
\ No newline at end of file
+717e385118aaa4f551bc0a7a0954681d
\ No newline at end of file
diff --git a/inherit_graph_104.svg b/inherit_graph_104.svg
index 4a5acfddc..a30ef46fa 100644
--- a/inherit_graph_104.svg
+++ b/inherit_graph_104.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-stack_linkedList
+
+stack< ValueType >
-
diff --git a/inherit_graph_105.md5 b/inherit_graph_105.md5
index c8cefab72..8a3a7c542 100644
--- a/inherit_graph_105.md5
+++ b/inherit_graph_105.md5
@@ -1 +1 @@
-adf4423c975497d5fe67f2bb0728f9b9
\ No newline at end of file
+f583284f2e396e0f7b5fd8bccf0bb840
\ No newline at end of file
diff --git a/inherit_graph_105.svg b/inherit_graph_105.svg
index fae146a0d..4a5acfddc 100644
--- a/inherit_graph_105.svg
+++ b/inherit_graph_105.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-statistics::stats_computer1< T >
+
+stack_linkedList
-
diff --git a/inherit_graph_106.md5 b/inherit_graph_106.md5
index 6a131a0c2..c8cefab72 100644
--- a/inherit_graph_106.md5
+++ b/inherit_graph_106.md5
@@ -1 +1 @@
-efb55af1cccef519836d4c2436ccda42
\ No newline at end of file
+adf4423c975497d5fe67f2bb0728f9b9
\ No newline at end of file
diff --git a/inherit_graph_106.svg b/inherit_graph_106.svg
index 9ba1559ca..fae146a0d 100644
--- a/inherit_graph_106.svg
+++ b/inherit_graph_106.svg
@@ -11,9 +11,9 @@
Node0
-
+
statistics::stats_computer2< T >
+statistics::stats_computer1< T >
-
diff --git a/inherit_graph_107.md5 b/inherit_graph_107.md5
index b9994081c..6a131a0c2 100644
--- a/inherit_graph_107.md5
+++ b/inherit_graph_107.md5
@@ -1 +1 @@
-53ba32e546959cac79e584e353db1db7
\ No newline at end of file
+efb55af1cccef519836d4c2436ccda42
\ No newline at end of file
diff --git a/inherit_graph_107.svg b/inherit_graph_107.svg
index f5df45beb..9ba1559ca 100644
--- a/inherit_graph_107.svg
+++ b/inherit_graph_107.svg
@@ -4,126 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-std::true_type
-
-
-
-
-Node1
-
-std::is_arithmetic
-< uint128_t >
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-std::is_arithmetic
-< uint256_t >
-
-
-
-
-Node0->Node2
-
-
-
-
-
-Node3
-
-std::is_integral< uint128_t >
-
-
-
-
-Node0->Node3
-
-
-
-
-
-Node4
-
-std::is_integral< uint256_t >
-
-
-
-
-Node0->Node4
-
-
-
-
-
-Node5
-
-std::is_unsigned< uint128_t >
-
-
-
-
-Node0->Node5
-
-
-
-
-
-Node6
-
-std::is_unsigned< uint256_t >
-
-
-
-
-Node0->Node6
-
-
+statistics::stats_computer2< T >
-
diff --git a/inherit_graph_108.md5 b/inherit_graph_108.md5
index d2b23f2ce..b9994081c 100644
--- a/inherit_graph_108.md5
+++ b/inherit_graph_108.md5
@@ -1 +1 @@
-d6ee5f042479b5982faa79c9932e1b9c
\ No newline at end of file
+53ba32e546959cac79e584e353db1db7
\ No newline at end of file
diff --git a/inherit_graph_108.svg b/inherit_graph_108.svg
index 6b36fd6f8..f5df45beb 100644
--- a/inherit_graph_108.svg
+++ b/inherit_graph_108.svg
@@ -4,17 +4,126 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-strings::boyer_moore
-::pattern
+
+std::true_type
+
+
+Node1
+
+std::is_arithmetic
+< uint128_t >
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+std::is_arithmetic
+< uint256_t >
+
+
+
+
+Node0->Node2
+
+
+
+
+
+Node3
+
+std::is_integral< uint128_t >
+
+
+
+
+Node0->Node3
+
+
+
+
+
+Node4
+
+std::is_integral< uint256_t >
+
+
+
+
+Node0->Node4
+
+
+
+
+
+Node5
+
+std::is_unsigned< uint128_t >
+
+
+
+
+Node0->Node5
+
+
+
+
+
+Node6
+
+std::is_unsigned< uint256_t >
+
+
+
+
+Node0->Node6
+
+
diff --git a/inherit_graph_109.map b/inherit_graph_109.map
index cd9e94752..453f8f72c 100644
--- a/inherit_graph_109.map
+++ b/inherit_graph_109.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_109.md5 b/inherit_graph_109.md5
index 2cfb4dbc5..d2b23f2ce 100644
--- a/inherit_graph_109.md5
+++ b/inherit_graph_109.md5
@@ -1 +1 @@
-abd7e48c602c9ba41e00a619e3234e23
\ No newline at end of file
+d6ee5f042479b5982faa79c9932e1b9c
\ No newline at end of file
diff --git a/inherit_graph_109.svg b/inherit_graph_109.svg
index c274c3ccc..6b36fd6f8 100644
--- a/inherit_graph_109.svg
+++ b/inherit_graph_109.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-TestCase
+
+strings::boyer_moore
+::pattern
-
diff --git a/inherit_graph_110.md5 b/inherit_graph_110.md5
index 078c92174..2cfb4dbc5 100644
--- a/inherit_graph_110.md5
+++ b/inherit_graph_110.md5
@@ -1 +1 @@
-a9d8d2a80cdf35dfac76eecdbb209456
\ No newline at end of file
+abd7e48c602c9ba41e00a619e3234e23
\ No newline at end of file
diff --git a/inherit_graph_110.svg b/inherit_graph_110.svg
index cdcf9a239..c274c3ccc 100644
--- a/inherit_graph_110.svg
+++ b/inherit_graph_110.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-TestCases
+
+TestCase
-
diff --git a/inherit_graph_111.md5 b/inherit_graph_111.md5
index 74da2954d..078c92174 100644
--- a/inherit_graph_111.md5
+++ b/inherit_graph_111.md5
@@ -1 +1 @@
-76f1c23145670e75e2e13d0451b74420
\ No newline at end of file
+a9d8d2a80cdf35dfac76eecdbb209456
\ No newline at end of file
diff --git a/inherit_graph_111.svg b/inherit_graph_111.svg
index 77d72ba40..cdcf9a239 100644
--- a/inherit_graph_111.svg
+++ b/inherit_graph_111.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-tower
+
+TestCases
-
diff --git a/inherit_graph_112.md5 b/inherit_graph_112.md5
index 94955023c..74da2954d 100644
--- a/inherit_graph_112.md5
+++ b/inherit_graph_112.md5
@@ -1 +1 @@
-845eae9f7c70e50cf22fb926bd9e034b
\ No newline at end of file
+76f1c23145670e75e2e13d0451b74420
\ No newline at end of file
diff --git a/inherit_graph_112.svg b/inherit_graph_112.svg
index 17806301d..77d72ba40 100644
--- a/inherit_graph_112.svg
+++ b/inherit_graph_112.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Trie
+
+tower
-
diff --git a/inherit_graph_113.md5 b/inherit_graph_113.md5
index 0362b08cb..94955023c 100644
--- a/inherit_graph_113.md5
+++ b/inherit_graph_113.md5
@@ -1 +1 @@
-a8666508fe9ca12fb7281895f580da44
\ No newline at end of file
+845eae9f7c70e50cf22fb926bd9e034b
\ No newline at end of file
diff --git a/inherit_graph_113.svg b/inherit_graph_113.svg
index 45674e189..17806301d 100644
--- a/inherit_graph_113.svg
+++ b/inherit_graph_113.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Trie::TrieNode
+
+Trie
-
diff --git a/inherit_graph_114.md5 b/inherit_graph_114.md5
index f04050dca..0362b08cb 100644
--- a/inherit_graph_114.md5
+++ b/inherit_graph_114.md5
@@ -1 +1 @@
-eed75a69314afbb385b920f554ca3c5d
\ No newline at end of file
+a8666508fe9ca12fb7281895f580da44
\ No newline at end of file
diff --git a/inherit_graph_114.svg b/inherit_graph_114.svg
index 4bc0ffaca..45674e189 100644
--- a/inherit_graph_114.svg
+++ b/inherit_graph_114.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-uint128_t
+
+Trie::TrieNode
-
diff --git a/inherit_graph_115.md5 b/inherit_graph_115.md5
index 8c62d9521..f04050dca 100644
--- a/inherit_graph_115.md5
+++ b/inherit_graph_115.md5
@@ -1 +1 @@
-805bd0d28e53f8af03d7b4e5906cc299
\ No newline at end of file
+eed75a69314afbb385b920f554ca3c5d
\ No newline at end of file
diff --git a/inherit_graph_115.svg b/inherit_graph_115.svg
index 877207d6d..4bc0ffaca 100644
--- a/inherit_graph_115.svg
+++ b/inherit_graph_115.svg
@@ -11,9 +11,9 @@
Node0
-
+
uint256_t
+uint128_t
+
diff --git a/inherit_graph_116.md5 b/inherit_graph_116.md5
new file mode 100644
index 000000000..8c62d9521
--- /dev/null
+++ b/inherit_graph_116.md5
@@ -0,0 +1 @@
+805bd0d28e53f8af03d7b4e5906cc299
\ No newline at end of file
diff --git a/inherit_graph_116.svg b/inherit_graph_116.svg
new file mode 100644
index 000000000..877207d6d
--- /dev/null
+++ b/inherit_graph_116.svg
@@ -0,0 +1,21 @@
+
+
+
+
+
+
+Graphical Class Hierarchy
+
+
+Node0
+
+uint256_t
+
+
+
+
diff --git a/inherit_graph_46.map b/inherit_graph_46.map
index 008a4e5b9..f6342b963 100644
--- a/inherit_graph_46.map
+++ b/inherit_graph_46.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_46.md5 b/inherit_graph_46.md5
index 0cc1066a1..6d367ae1d 100644
--- a/inherit_graph_46.md5
+++ b/inherit_graph_46.md5
@@ -1 +1 @@
-d49275e311f6a88b3379b5c0836eca80
\ No newline at end of file
+cfe9322e3eeb43e8e715c063b7b5f5d2
\ No newline at end of file
diff --git a/inherit_graph_46.svg b/inherit_graph_46.svg
index 12bbc0ca0..cefe28a4b 100644
--- a/inherit_graph_46.svg
+++ b/inherit_graph_46.svg
@@ -11,10 +11,10 @@
Node0
-
+
greedy_algorithms::
-DigitSeparation
+BinaryAddition
-
diff --git a/inherit_graph_47.md5 b/inherit_graph_47.md5
index b1bb9f613..0cc1066a1 100644
--- a/inherit_graph_47.md5
+++ b/inherit_graph_47.md5
@@ -1 +1 @@
-eacbeee425b4f9f6a77295d74c2f76dd
\ No newline at end of file
+d49275e311f6a88b3379b5c0836eca80
\ No newline at end of file
diff --git a/inherit_graph_47.svg b/inherit_graph_47.svg
index a9cb365dd..12bbc0ca0 100644
--- a/inherit_graph_47.svg
+++ b/inherit_graph_47.svg
@@ -11,10 +11,10 @@
Node0
-
+
greedy_algorithms::
-dijkstra::Graph
+DigitSeparation
-
diff --git a/inherit_graph_48.md5 b/inherit_graph_48.md5
index 25d4c3ab7..b1bb9f613 100644
--- a/inherit_graph_48.md5
+++ b/inherit_graph_48.md5
@@ -1 +1 @@
-5f49bba0e53577a5b75cb5973529bade
\ No newline at end of file
+eacbeee425b4f9f6a77295d74c2f76dd
\ No newline at end of file
diff --git a/inherit_graph_48.svg b/inherit_graph_48.svg
index 5c2be53cb..a9cb365dd 100644
--- a/inherit_graph_48.svg
+++ b/inherit_graph_48.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-hash_chain
+
+greedy_algorithms::
+dijkstra::Graph
-
diff --git a/inherit_graph_49.md5 b/inherit_graph_49.md5
index 055c62354..25d4c3ab7 100644
--- a/inherit_graph_49.md5
+++ b/inherit_graph_49.md5
@@ -1 +1 @@
-6c9571951ecc9353af9c005c0b55ccb6
\ No newline at end of file
+5f49bba0e53577a5b75cb5973529bade
\ No newline at end of file
diff --git a/inherit_graph_49.svg b/inherit_graph_49.svg
index 4d33c095e..5c2be53cb 100644
--- a/inherit_graph_49.svg
+++ b/inherit_graph_49.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-hashing::sha256::Hash
+
+hash_chain
-
diff --git a/inherit_graph_50.md5 b/inherit_graph_50.md5
index 8a0d2c09e..055c62354 100644
--- a/inherit_graph_50.md5
+++ b/inherit_graph_50.md5
@@ -1 +1 @@
-59139005b32506728fd8d3323cc419fc
\ No newline at end of file
+6c9571951ecc9353af9c005c0b55ccb6
\ No newline at end of file
diff --git a/inherit_graph_50.svg b/inherit_graph_50.svg
index 97a6e23a1..4d33c095e 100644
--- a/inherit_graph_50.svg
+++ b/inherit_graph_50.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Item
+
+hashing::sha256::Hash
-
diff --git a/inherit_graph_51.md5 b/inherit_graph_51.md5
index 704ac465f..8a0d2c09e 100644
--- a/inherit_graph_51.md5
+++ b/inherit_graph_51.md5
@@ -1 +1 @@
-1c1c2c26230468d96731424183714320
\ No newline at end of file
+59139005b32506728fd8d3323cc419fc
\ No newline at end of file
diff --git a/inherit_graph_51.svg b/inherit_graph_51.svg
index b60c1991b..97a6e23a1 100644
--- a/inherit_graph_51.svg
+++ b/inherit_graph_51.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-large_number
+
+Item
-
diff --git a/inherit_graph_52.md5 b/inherit_graph_52.md5
index 4ea33de34..704ac465f 100644
--- a/inherit_graph_52.md5
+++ b/inherit_graph_52.md5
@@ -1 +1 @@
-aec2bb5e51f511ef7811875e5b768be0
\ No newline at end of file
+1c1c2c26230468d96731424183714320
\ No newline at end of file
diff --git a/inherit_graph_52.svg b/inherit_graph_52.svg
index 7f4222145..b60c1991b 100644
--- a/inherit_graph_52.svg
+++ b/inherit_graph_52.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-linear_probing::Entry
+
+large_number
-
diff --git a/inherit_graph_53.md5 b/inherit_graph_53.md5
index c8d3c2de6..4ea33de34 100644
--- a/inherit_graph_53.md5
+++ b/inherit_graph_53.md5
@@ -1 +1 @@
-8e83f7de99c4092cec0ef9a67422e9cf
\ No newline at end of file
+aec2bb5e51f511ef7811875e5b768be0
\ No newline at end of file
diff --git a/inherit_graph_53.svg b/inherit_graph_53.svg
index fc9354600..7f4222145 100644
--- a/inherit_graph_53.svg
+++ b/inherit_graph_53.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-linkedlist
+
+linear_probing::Entry
-
diff --git a/inherit_graph_54.md5 b/inherit_graph_54.md5
index 93a29532d..c8d3c2de6 100644
--- a/inherit_graph_54.md5
+++ b/inherit_graph_54.md5
@@ -1 +1 @@
-affe8d5f7bdf7b59b4a463a955d67294
\ No newline at end of file
+8e83f7de99c4092cec0ef9a67422e9cf
\ No newline at end of file
diff --git a/inherit_graph_54.svg b/inherit_graph_54.svg
index f0dfafc1d..fc9354600 100644
--- a/inherit_graph_54.svg
+++ b/inherit_graph_54.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-list
+
+linkedlist
-
diff --git a/inherit_graph_55.md5 b/inherit_graph_55.md5
index baf616f59..93a29532d 100644
--- a/inherit_graph_55.md5
+++ b/inherit_graph_55.md5
@@ -1 +1 @@
-5045664194b514cfb842bab0686efcc1
\ No newline at end of file
+affe8d5f7bdf7b59b4a463a955d67294
\ No newline at end of file
diff --git a/inherit_graph_55.svg b/inherit_graph_55.svg
index c0ddc0d03..f0dfafc1d 100644
--- a/inherit_graph_55.svg
+++ b/inherit_graph_55.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-ListNode
+
+list
-
diff --git a/inherit_graph_56.md5 b/inherit_graph_56.md5
index 3c3023c8b..baf616f59 100644
--- a/inherit_graph_56.md5
+++ b/inherit_graph_56.md5
@@ -1 +1 @@
-1653a76821494d4ce3a543c625f3ede5
\ No newline at end of file
+5045664194b514cfb842bab0686efcc1
\ No newline at end of file
diff --git a/inherit_graph_56.svg b/inherit_graph_56.svg
index 3e50afe4c..c0ddc0d03 100644
--- a/inherit_graph_56.svg
+++ b/inherit_graph_56.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Longest_Substring
+
+ListNode
-
diff --git a/inherit_graph_57.md5 b/inherit_graph_57.md5
index 407dd187b..3c3023c8b 100644
--- a/inherit_graph_57.md5
+++ b/inherit_graph_57.md5
@@ -1 +1 @@
-2e8e1d413e495f551e733eb5369a6e2b
\ No newline at end of file
+1653a76821494d4ce3a543c625f3ede5
\ No newline at end of file
diff --git a/inherit_graph_57.svg b/inherit_graph_57.svg
index fdc8dab41..3e50afe4c 100644
--- a/inherit_graph_57.svg
+++ b/inherit_graph_57.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-machine_learning::adaline
+
+Longest_Substring
-
diff --git a/inherit_graph_58.md5 b/inherit_graph_58.md5
index aa1a808ba..407dd187b 100644
--- a/inherit_graph_58.md5
+++ b/inherit_graph_58.md5
@@ -1 +1 @@
-7e09d29ef16a8e17f2fc718f7adf3a92
\ No newline at end of file
+2e8e1d413e495f551e733eb5369a6e2b
\ No newline at end of file
diff --git a/inherit_graph_58.svg b/inherit_graph_58.svg
index 505cacf5d..fdc8dab41 100644
--- a/inherit_graph_58.svg
+++ b/inherit_graph_58.svg
@@ -4,18 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-machine_learning::aystar
-_search::AyStarSearch<
- Puzzle >
+
+machine_learning::adaline
-
diff --git a/inherit_graph_59.md5 b/inherit_graph_59.md5
index 2beb7b996..aa1a808ba 100644
--- a/inherit_graph_59.md5
+++ b/inherit_graph_59.md5
@@ -1 +1 @@
-6ee2bf3fe6c368836de3901609b53267
\ No newline at end of file
+7e09d29ef16a8e17f2fc718f7adf3a92
\ No newline at end of file
diff --git a/inherit_graph_59.svg b/inherit_graph_59.svg
index e94d5292b..505cacf5d 100644
--- a/inherit_graph_59.svg
+++ b/inherit_graph_59.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+machine_learning::aystar
_search::AyStarSearch<
- Puzzle >::comparison_operator
+ Puzzle >
-
diff --git a/inherit_graph_60.md5 b/inherit_graph_60.md5
index 15d4e0a9b..2beb7b996 100644
--- a/inherit_graph_60.md5
+++ b/inherit_graph_60.md5
@@ -1 +1 @@
-3d686ef3c6aeac1f7d55534f2c7df929
\ No newline at end of file
+6ee2bf3fe6c368836de3901609b53267
\ No newline at end of file
diff --git a/inherit_graph_60.svg b/inherit_graph_60.svg
index e01e7ad14..e94d5292b 100644
--- a/inherit_graph_60.svg
+++ b/inherit_graph_60.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+machine_learning::aystar
_search::AyStarSearch<
- Puzzle >::Info
+ Puzzle >::comparison_operator
-
diff --git a/inherit_graph_61.md5 b/inherit_graph_61.md5
index d1b3bc11e..15d4e0a9b 100644
--- a/inherit_graph_61.md5
+++ b/inherit_graph_61.md5
@@ -1 +1 @@
-c9067724c2b1307aad5f178edfcc951c
\ No newline at end of file
+3d686ef3c6aeac1f7d55534f2c7df929
\ No newline at end of file
diff --git a/inherit_graph_61.svg b/inherit_graph_61.svg
index b47bd1b32..e01e7ad14 100644
--- a/inherit_graph_61.svg
+++ b/inherit_graph_61.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-machine_learning::aystar
-_search::EightPuzzle< N >
+
+machine_learning::aystar
+_search::AyStarSearch<
+ Puzzle >::Info
-
diff --git a/inherit_graph_62.md5 b/inherit_graph_62.md5
index d2de7adcd..d1b3bc11e 100644
--- a/inherit_graph_62.md5
+++ b/inherit_graph_62.md5
@@ -1 +1 @@
-b1ff3363dccc06e01bf09a11d629f080
\ No newline at end of file
+c9067724c2b1307aad5f178edfcc951c
\ No newline at end of file
diff --git a/inherit_graph_62.svg b/inherit_graph_62.svg
index efdc44dee..b47bd1b32 100644
--- a/inherit_graph_62.svg
+++ b/inherit_graph_62.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-machine_learning::k
-_nearest_neighbors::Knn
+
+machine_learning::aystar
+_search::EightPuzzle< N >
-
diff --git a/inherit_graph_63.md5 b/inherit_graph_63.md5
index 405905162..d2de7adcd 100644
--- a/inherit_graph_63.md5
+++ b/inherit_graph_63.md5
@@ -1 +1 @@
-2be97cdbdd926a8024864809bee4bdff
\ No newline at end of file
+b1ff3363dccc06e01bf09a11d629f080
\ No newline at end of file
diff --git a/inherit_graph_63.svg b/inherit_graph_63.svg
index b31861b0c..efdc44dee 100644
--- a/inherit_graph_63.svg
+++ b/inherit_graph_63.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-machine_learning::neural
-_network::layers::DenseLayer
+
+machine_learning::k
+_nearest_neighbors::Knn
-
diff --git a/inherit_graph_64.md5 b/inherit_graph_64.md5
index 49caa851a..405905162 100644
--- a/inherit_graph_64.md5
+++ b/inherit_graph_64.md5
@@ -1 +1 @@
-3a287905d5fc786607b16577afc8577a
\ No newline at end of file
+2be97cdbdd926a8024864809bee4bdff
\ No newline at end of file
diff --git a/inherit_graph_64.svg b/inherit_graph_64.svg
index 167cebce1..b31861b0c 100644
--- a/inherit_graph_64.svg
+++ b/inherit_graph_64.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+machine_learning::neural
-_network::NeuralNetwork
+_network::layers::DenseLayer
-
diff --git a/inherit_graph_65.md5 b/inherit_graph_65.md5
index cec1fc052..49caa851a 100644
--- a/inherit_graph_65.md5
+++ b/inherit_graph_65.md5
@@ -1 +1 @@
-43af52015ea93acc511116e0c0f11118
\ No newline at end of file
+3a287905d5fc786607b16577afc8577a
\ No newline at end of file
diff --git a/inherit_graph_65.svg b/inherit_graph_65.svg
index 1fb54aa07..167cebce1 100644
--- a/inherit_graph_65.svg
+++ b/inherit_graph_65.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-math::ncr_modulo_p
-::NCRModuloP
+
+machine_learning::neural
+_network::NeuralNetwork
-
diff --git a/inherit_graph_66.md5 b/inherit_graph_66.md5
index 489e9bbb3..cec1fc052 100644
--- a/inherit_graph_66.md5
+++ b/inherit_graph_66.md5
@@ -1 +1 @@
-e46778d68f07b3d0f85c1a830a98dc2f
\ No newline at end of file
+43af52015ea93acc511116e0c0f11118
\ No newline at end of file
diff --git a/inherit_graph_66.svg b/inherit_graph_66.svg
index a502f5f91..1fb54aa07 100644
--- a/inherit_graph_66.svg
+++ b/inherit_graph_66.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-MinHeap
+
+math::ncr_modulo_p
+::NCRModuloP
-
diff --git a/inherit_graph_67.md5 b/inherit_graph_67.md5
index 01a90fbec..489e9bbb3 100644
--- a/inherit_graph_67.md5
+++ b/inherit_graph_67.md5
@@ -1 +1 @@
-cf8942ba7ef89dd77e0e92d576486218
\ No newline at end of file
+e46778d68f07b3d0f85c1a830a98dc2f
\ No newline at end of file
diff --git a/inherit_graph_67.svg b/inherit_graph_67.svg
index 13cffd4cf..a502f5f91 100644
--- a/inherit_graph_67.svg
+++ b/inherit_graph_67.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-MinHeapNode
+
+MinHeap
-
diff --git a/inherit_graph_68.md5 b/inherit_graph_68.md5
index febc905f0..01a90fbec 100644
--- a/inherit_graph_68.md5
+++ b/inherit_graph_68.md5
@@ -1 +1 @@
-af810061f564e6fde90b0872fbea4b5a
\ No newline at end of file
+cf8942ba7ef89dd77e0e92d576486218
\ No newline at end of file
diff --git a/inherit_graph_68.svg b/inherit_graph_68.svg
index a67adf179..13cffd4cf 100644
--- a/inherit_graph_68.svg
+++ b/inherit_graph_68.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-mst
+
+MinHeapNode
-
diff --git a/inherit_graph_69.md5 b/inherit_graph_69.md5
index 440617f0a..febc905f0 100644
--- a/inherit_graph_69.md5
+++ b/inherit_graph_69.md5
@@ -1 +1 @@
-0f4a65424288e970abb85f1f24c4b68d
\ No newline at end of file
+af810061f564e6fde90b0872fbea4b5a
\ No newline at end of file
diff --git a/inherit_graph_69.svg b/inherit_graph_69.svg
index 39cf54c05..a67adf179 100644
--- a/inherit_graph_69.svg
+++ b/inherit_graph_69.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-node
+
+mst
-
diff --git a/inherit_graph_70.md5 b/inherit_graph_70.md5
index dc9b5b8bf..440617f0a 100644
--- a/inherit_graph_70.md5
+++ b/inherit_graph_70.md5
@@ -1 +1 @@
-31d376f965d0c96100f12c992693f97f
\ No newline at end of file
+0f4a65424288e970abb85f1f24c4b68d
\ No newline at end of file
diff --git a/inherit_graph_70.svg b/inherit_graph_70.svg
index df1b1ffb5..39cf54c05 100644
--- a/inherit_graph_70.svg
+++ b/inherit_graph_70.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Node< value_type >
+
+node
-
diff --git a/inherit_graph_71.md5 b/inherit_graph_71.md5
index c1ac1eff6..dc9b5b8bf 100644
--- a/inherit_graph_71.md5
+++ b/inherit_graph_71.md5
@@ -1 +1 @@
-b2fca7f12e3a51e27d18b20b6219a04b
\ No newline at end of file
+31d376f965d0c96100f12c992693f97f
\ No newline at end of file
diff --git a/inherit_graph_71.svg b/inherit_graph_71.svg
index e539e8037..df1b1ffb5 100644
--- a/inherit_graph_71.svg
+++ b/inherit_graph_71.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-Node< ValueType >
+Node< value_type >
diff --git a/inherit_graph_72.map b/inherit_graph_72.map
index 79dd2ded3..48ed6242d 100644
--- a/inherit_graph_72.map
+++ b/inherit_graph_72.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_72.md5 b/inherit_graph_72.md5
index 748751e2b..c1ac1eff6 100644
--- a/inherit_graph_72.md5
+++ b/inherit_graph_72.md5
@@ -1 +1 @@
-519b1f1f6d9604681fda7db93369d107
\ No newline at end of file
+b2fca7f12e3a51e27d18b20b6219a04b
\ No newline at end of file
diff --git a/inherit_graph_72.svg b/inherit_graph_72.svg
index fc5f1a317..e539e8037 100644
--- a/inherit_graph_72.svg
+++ b/inherit_graph_72.svg
@@ -4,18 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-operations_on_datastructures
-::circular_linked_list::Circular
-LinkedList
+
+Node< ValueType >
-
diff --git a/inherit_graph_73.md5 b/inherit_graph_73.md5
index e84ffc32c..748751e2b 100644
--- a/inherit_graph_73.md5
+++ b/inherit_graph_73.md5
@@ -1 +1 @@
-89867a2820e6afc3445e0931972f19f8
\ No newline at end of file
+519b1f1f6d9604681fda7db93369d107
\ No newline at end of file
diff --git a/inherit_graph_73.svg b/inherit_graph_73.svg
index f3bb20b97..fc5f1a317 100644
--- a/inherit_graph_73.svg
+++ b/inherit_graph_73.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-operations_on_datastructures
-::circular_linked_list::Node
+
+operations_on_datastructures
+::circular_linked_list::Circular
+LinkedList
-
diff --git a/inherit_graph_74.md5 b/inherit_graph_74.md5
index e5ef142d1..e84ffc32c 100644
--- a/inherit_graph_74.md5
+++ b/inherit_graph_74.md5
@@ -1 +1 @@
-de5e2e2f4dd5ebd06ad08fa01be3112a
\ No newline at end of file
+89867a2820e6afc3445e0931972f19f8
\ No newline at end of file
diff --git a/inherit_graph_74.svg b/inherit_graph_74.svg
index 56cf9d542..f3bb20b97 100644
--- a/inherit_graph_74.svg
+++ b/inherit_graph_74.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+operations_on_datastructures
-::inorder_traversal_of_bst::Node
+::circular_linked_list::Node
-
diff --git a/inherit_graph_75.md5 b/inherit_graph_75.md5
index 924907713..e5ef142d1 100644
--- a/inherit_graph_75.md5
+++ b/inherit_graph_75.md5
@@ -1 +1 @@
-711a97321669830ce7337fbf526fa364
\ No newline at end of file
+de5e2e2f4dd5ebd06ad08fa01be3112a
\ No newline at end of file
diff --git a/inherit_graph_75.svg b/inherit_graph_75.svg
index 118e0468c..56cf9d542 100644
--- a/inherit_graph_75.svg
+++ b/inherit_graph_75.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+operations_on_datastructures
-::reverse_binary_tree::BinaryTree
+::inorder_traversal_of_bst::Node
-
diff --git a/inherit_graph_76.md5 b/inherit_graph_76.md5
index 4c8159bc4..924907713 100644
--- a/inherit_graph_76.md5
+++ b/inherit_graph_76.md5
@@ -1 +1 @@
-7ee46acf738ef592e7c5872c51a2b412
\ No newline at end of file
+711a97321669830ce7337fbf526fa364
\ No newline at end of file
diff --git a/inherit_graph_76.svg b/inherit_graph_76.svg
index 2aaf2f8d5..118e0468c 100644
--- a/inherit_graph_76.svg
+++ b/inherit_graph_76.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+operations_on_datastructures
-::reverse_binary_tree::Node
+::reverse_binary_tree::BinaryTree
-
diff --git a/inherit_graph_77.md5 b/inherit_graph_77.md5
index cdaa3c84f..4c8159bc4 100644
--- a/inherit_graph_77.md5
+++ b/inherit_graph_77.md5
@@ -1 +1 @@
-95f13092f90a17991418f843e09549cc
\ No newline at end of file
+7ee46acf738ef592e7c5872c51a2b412
\ No newline at end of file
diff --git a/inherit_graph_77.svg b/inherit_graph_77.svg
index f7b851150..2aaf2f8d5 100644
--- a/inherit_graph_77.svg
+++ b/inherit_graph_77.svg
@@ -11,10 +11,10 @@
Node0
-
+
operations_on_datastructures
-::trie_operations::Tnode
+::reverse_binary_tree::Node
-
diff --git a/inherit_graph_78.md5 b/inherit_graph_78.md5
index 4f76c8f03..cdaa3c84f 100644
--- a/inherit_graph_78.md5
+++ b/inherit_graph_78.md5
@@ -1 +1 @@
-70af106aefc7c5493c7dfe937cbf7fe3
\ No newline at end of file
+95f13092f90a17991418f843e09549cc
\ No newline at end of file
diff --git a/inherit_graph_78.svg b/inherit_graph_78.svg
index 7ff9d7873..f7b851150 100644
--- a/inherit_graph_78.svg
+++ b/inherit_graph_78.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::Cache::D_Node
-< K, V >
+
+operations_on_datastructures
+::trie_operations::Tnode
-
diff --git a/inherit_graph_79.md5 b/inherit_graph_79.md5
index 68a782f80..4f76c8f03 100644
--- a/inherit_graph_79.md5
+++ b/inherit_graph_79.md5
@@ -1 +1 @@
-eb6f17d4ef034f6bf576f9f000786c26
\ No newline at end of file
+70af106aefc7c5493c7dfe937cbf7fe3
\ No newline at end of file
diff --git a/inherit_graph_79.svg b/inherit_graph_79.svg
index 16ac3150a..7ff9d7873 100644
--- a/inherit_graph_79.svg
+++ b/inherit_graph_79.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-others::Cache::D_Node< T >
+
+others::Cache::D_Node
+< K, V >
-
diff --git a/inherit_graph_80.md5 b/inherit_graph_80.md5
index 0bbe1a9f0..68a782f80 100644
--- a/inherit_graph_80.md5
+++ b/inherit_graph_80.md5
@@ -1 +1 @@
-02033460485a6b9d233fc95c003d9067
\ No newline at end of file
+eb6f17d4ef034f6bf576f9f000786c26
\ No newline at end of file
diff --git a/inherit_graph_80.svg b/inherit_graph_80.svg
index 24c46fda7..16ac3150a 100644
--- a/inherit_graph_80.svg
+++ b/inherit_graph_80.svg
@@ -4,17 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-others::Cache::LFUCache
-< K, V >
+
+others::Cache::D_Node< T >
-
diff --git a/inherit_graph_81.md5 b/inherit_graph_81.md5
index 350549659..0bbe1a9f0 100644
--- a/inherit_graph_81.md5
+++ b/inherit_graph_81.md5
@@ -1 +1 @@
-d7d5d44ee0e0c927d8fd870dfd9751d1
\ No newline at end of file
+02033460485a6b9d233fc95c003d9067
\ No newline at end of file
diff --git a/inherit_graph_81.svg b/inherit_graph_81.svg
index 9152d6e3b..24c46fda7 100644
--- a/inherit_graph_81.svg
+++ b/inherit_graph_81.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::Cache::LRUCache
-< K, V >
+
+others::Cache::LFUCache
+< K, V >
-
diff --git a/inherit_graph_82.md5 b/inherit_graph_82.md5
index e4d240c66..350549659 100644
--- a/inherit_graph_82.md5
+++ b/inherit_graph_82.md5
@@ -1 +1 @@
-86a9f12a6fa0147840e866fbeb575055
\ No newline at end of file
+d7d5d44ee0e0c927d8fd870dfd9751d1
\ No newline at end of file
diff --git a/inherit_graph_82.svg b/inherit_graph_82.svg
index 378318d91..9152d6e3b 100644
--- a/inherit_graph_82.svg
+++ b/inherit_graph_82.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::iterative_tree
-_traversals::BinaryTree
+
+others::Cache::LRUCache
+< K, V >
-
diff --git a/inherit_graph_83.md5 b/inherit_graph_83.md5
index 034ef82f1..e4d240c66 100644
--- a/inherit_graph_83.md5
+++ b/inherit_graph_83.md5
@@ -1 +1 @@
-c4e403fe3e48d0c7ab58a940c6c5c0b2
\ No newline at end of file
+86a9f12a6fa0147840e866fbeb575055
\ No newline at end of file
diff --git a/inherit_graph_83.svg b/inherit_graph_83.svg
index 8ddb70b16..378318d91 100644
--- a/inherit_graph_83.svg
+++ b/inherit_graph_83.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+others::iterative_tree
-_traversals::Node
+_traversals::BinaryTree
-
diff --git a/inherit_graph_84.md5 b/inherit_graph_84.md5
index 8ea66fcc3..034ef82f1 100644
--- a/inherit_graph_84.md5
+++ b/inherit_graph_84.md5
@@ -1 +1 @@
-c57f59e02cf53191d7fc08844b9be12f
\ No newline at end of file
+c4e403fe3e48d0c7ab58a940c6c5c0b2
\ No newline at end of file
diff --git a/inherit_graph_84.svg b/inherit_graph_84.svg
index 77dfc0388..8ddb70b16 100644
--- a/inherit_graph_84.svg
+++ b/inherit_graph_84.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::lru_cache::
-LRUCache
+
+others::iterative_tree
+_traversals::Node
-
diff --git a/inherit_graph_85.md5 b/inherit_graph_85.md5
index b16955cf8..8ea66fcc3 100644
--- a/inherit_graph_85.md5
+++ b/inherit_graph_85.md5
@@ -1 +1 @@
-3cf038b6307ab2b4487f41674605276b
\ No newline at end of file
+c57f59e02cf53191d7fc08844b9be12f
\ No newline at end of file
diff --git a/inherit_graph_85.svg b/inherit_graph_85.svg
index b9eec102e..77dfc0388 100644
--- a/inherit_graph_85.svg
+++ b/inherit_graph_85.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::postfix_expression
-::Stack
+
+others::lru_cache::
+LRUCache
-
diff --git a/inherit_graph_86.md5 b/inherit_graph_86.md5
index b8ccc104a..b16955cf8 100644
--- a/inherit_graph_86.md5
+++ b/inherit_graph_86.md5
@@ -1 +1 @@
-dae232725c13eb6a5d6f730fcdb228d8
\ No newline at end of file
+3cf038b6307ab2b4487f41674605276b
\ No newline at end of file
diff --git a/inherit_graph_86.svg b/inherit_graph_86.svg
index 8cb8cfd08..b9eec102e 100644
--- a/inherit_graph_86.svg
+++ b/inherit_graph_86.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::recursive_tree
-_traversals::BT
+
+others::postfix_expression
+::Stack
-
diff --git a/inherit_graph_87.md5 b/inherit_graph_87.md5
index f3256979f..b8ccc104a 100644
--- a/inherit_graph_87.md5
+++ b/inherit_graph_87.md5
@@ -1 +1 @@
-f6de32f06c598964a8bab66bcc4b62a8
\ No newline at end of file
+dae232725c13eb6a5d6f730fcdb228d8
\ No newline at end of file
diff --git a/inherit_graph_87.svg b/inherit_graph_87.svg
index df84a5573..8cb8cfd08 100644
--- a/inherit_graph_87.svg
+++ b/inherit_graph_87.svg
@@ -11,10 +11,10 @@
Node0
-
+
others::recursive_tree
-_traversals::Node
+_traversals::BT
-
diff --git a/inherit_graph_88.md5 b/inherit_graph_88.md5
index 82f9f0c95..f3256979f 100644
--- a/inherit_graph_88.md5
+++ b/inherit_graph_88.md5
@@ -1 +1 @@
-820705e674915c505f0cb90620ddf48e
\ No newline at end of file
+f6de32f06c598964a8bab66bcc4b62a8
\ No newline at end of file
diff --git a/inherit_graph_88.svg b/inherit_graph_88.svg
index c122b804c..df84a5573 100644
--- a/inherit_graph_88.svg
+++ b/inherit_graph_88.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-Point
+
+others::recursive_tree
+_traversals::Node
-
diff --git a/inherit_graph_89.md5 b/inherit_graph_89.md5
index 11a68b827..82f9f0c95 100644
--- a/inherit_graph_89.md5
+++ b/inherit_graph_89.md5
@@ -1 +1 @@
-5b7ba5d5b7d5d9feaed21d586b738263
\ No newline at end of file
+820705e674915c505f0cb90620ddf48e
\ No newline at end of file
diff --git a/inherit_graph_89.svg b/inherit_graph_89.svg
index 2e51b0acb..c122b804c 100644
--- a/inherit_graph_89.svg
+++ b/inherit_graph_89.svg
@@ -4,17 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-probability::geometric
-_dist::geometric_distribution
+
+Point
-
diff --git a/inherit_graph_90.md5 b/inherit_graph_90.md5
index 31bf89136..11a68b827 100644
--- a/inherit_graph_90.md5
+++ b/inherit_graph_90.md5
@@ -1 +1 @@
-0f9b5f8b412026fbb732ea3c163679e3
\ No newline at end of file
+5b7ba5d5b7d5d9feaed21d586b738263
\ No newline at end of file
diff --git a/inherit_graph_90.svg b/inherit_graph_90.svg
index 4c20c92f3..2e51b0acb 100644
--- a/inherit_graph_90.svg
+++ b/inherit_graph_90.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-probability::windowed
-_median::WindowedMedian
+
+probability::geometric
+_dist::geometric_distribution
-
diff --git a/inherit_graph_91.md5 b/inherit_graph_91.md5
index 0976e6802..31bf89136 100644
--- a/inherit_graph_91.md5
+++ b/inherit_graph_91.md5
@@ -1 +1 @@
-878fe0c22ffb95857248a61b2e026f2e
\ No newline at end of file
+0f9b5f8b412026fbb732ea3c163679e3
\ No newline at end of file
diff --git a/inherit_graph_91.svg b/inherit_graph_91.svg
index e5553fcaf..4c20c92f3 100644
--- a/inherit_graph_91.svg
+++ b/inherit_graph_91.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-quadratic_probing::
-Entry
+
1.12.0
+