Node0
-
+
uint256_t
+uint128_t
+
diff --git a/inherit_graph_82.md5 b/inherit_graph_82.md5
new file mode 100644
index 000000000..3fb1b78c7
--- /dev/null
+++ b/inherit_graph_82.md5
@@ -0,0 +1 @@
+5323d65878d4e52ab324687ba213b79a
\ No newline at end of file
diff --git a/inherit_graph_82.svg b/inherit_graph_82.svg
new file mode 100644
index 000000000..2521b2b9a
--- /dev/null
+++ b/inherit_graph_82.svg
@@ -0,0 +1,22 @@
+
+
+
+
+
+
+Graphical Class Hierarchy
+
+Node0
+
+uint256_t
+
+
+
+
diff --git a/inherits.html b/inherits.html
index b023681c6..c9edbcef1 100644
--- a/inherits.html
+++ b/inherits.html
@@ -214,52 +214,54 @@ $(document).ready(function(){initNavTree('hierarchy.html',''); initResizable();
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ N dynamic_programming Dynamic Programming algorithms N false_position Functions for False Position method N fibonacci_sum Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) ► N geometry Geometry algorithms ► N jarvis C Convexhull C Point N gram_schmidt Functions for Gram Schmidt Orthogonalisation Process ► N graph Graph Algorithms N bidirectional_dijkstra N depth_first_search N disjoint_union ► N is_graph_bipartite C Graph Class for representing graph as an adjacency list C Graph C HKGraph Represents Bipartite graph for Hopcroft Karp implementation C LowestCommonAncestor C RootedTree N hamming_distance Functions for Hamming distance implementation N hashing Hashing algorithms N heavy_light_decomposition Heavy light decomposition algorithm N horspool Functions for Horspool's algorithm N house_robber Functions for the House Robber algorithm N inorder_successor_of_bst Functions for the Inorder successor of a binary search tree implementation N inversion Functions for counting inversions using Merge Sort algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N iterative_tree_traversals Functions for the Traversal of the Tree algorithm N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N karatsuba_algorithm Functions for the Karatsuba algorithm for fast multiplication N Knapsack Implementation of 0-1 Knapsack problem N layers This namespace contains layers used in MLP N linear_algebra For io operations ► N linear_probing An implementation of hash table using linear probing algorithm C Entry N linear_recurrence_matrix Functions for Linear Recurrence Matrix implementation N linked_list Functions for singly linked list algorithm N list_array Functions for Dynamic Array algorithm N lru_cache Implementation of the LRU caching algorithm N lru_tests ► N machine_learning A* search algorithm ► N aystar_search ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state C comparison_operator Custom comparator for open_list C Info Struct that handles all the information related to the current state C EightPuzzle A class defining EightPuzzle/15-Puzzle game ► N neural_network N activations ► N layers C DenseLayer N util_functions C NeuralNetwork C adaline N magic_sequence Functions for the Magic sequence implementation N manacher Functions for Manacher's Algorithm implementation ► N math For IO operations N binomial N fibonacci_sum N modular_division N n_bonacci ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p N vector_cross N MD5 Functions for the MD5 algorithm implementation N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N mincoins_topdown Functions for minimum coin exchange problem N Minimum Implementation of Minimum Edit Distance algorithm N modular_division Functions for Modular Division implementation N morse Functions for Morse Code N n_bonacci Functions for the N-bonacci implementation N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N ncr_modulo_p Functions for nCr modulo p implementation N neural_network Neural Network or Multilayer Perceptron N numerical_methods For io operations ► N operations_on_datastructures For std::vector ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ► N others For vector ► N iterative_tree_traversals C BinaryTree Defines the functions associated with the binary tree C Node Defines the structure of a node of the tree ► N lru_cache C LRUCache LRU cache class ► N postfix_expression C Stack Creates an array to be used as stack for storing values N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm ► N probability For std::vector - needed in testing ► N windowed_median C WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values N qr_algorithm Functions to compute QR decomposition of any rectangular matrix ► N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry N queue_using_array Functions for Queue using Array implementation N radix_sort Functions for Radix sort algorithm N random_pivot_quick_sort Functions for the Random Pivot Quick Sort implementation ► N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C HLD The Heavy-Light Decomposition class C SG Segment Tree , to store heavy chains C Tree A Basic Tree , which supports binary lifting N sparse_table ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
+ N geometric_dist Functions for the Geometric Distribution algorithm implementation ► N geometry Geometry algorithms ► N jarvis C Convexhull C Point N gram_schmidt Functions for Gram Schmidt Orthogonalisation Process ► N graph Graph Algorithms N bidirectional_dijkstra N depth_first_search N disjoint_union ► N is_graph_bipartite C Graph Class for representing graph as an adjacency list C Graph C HKGraph Represents Bipartite graph for Hopcroft Karp implementation C LowestCommonAncestor C RootedTree N hamming_distance Functions for Hamming distance implementation N hashing Hashing algorithms N heavy_light_decomposition Heavy light decomposition algorithm N horspool Functions for Horspool's algorithm N house_robber Functions for the House Robber algorithm N inorder_successor_of_bst Functions for the Inorder successor of a binary search tree implementation N inversion Functions for counting inversions using Merge Sort algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N iterative_tree_traversals Functions for the Traversal of the Tree algorithm N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N karatsuba_algorithm Functions for the Karatsuba algorithm for fast multiplication N Knapsack Implementation of 0-1 Knapsack problem N layers This namespace contains layers used in MLP N linear_algebra For io operations ► N linear_probing An implementation of hash table using linear probing algorithm C Entry N linear_recurrence_matrix Functions for Linear Recurrence Matrix implementation N linked_list Functions for singly linked list algorithm N list_array Functions for Dynamic Array algorithm N lru_cache Implementation of the LRU caching algorithm N lru_tests ► N machine_learning A* search algorithm ► N aystar_search ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state C comparison_operator Custom comparator for open_list C Info Struct that handles all the information related to the current state C EightPuzzle A class defining EightPuzzle/15-Puzzle game ► N neural_network N activations ► N layers C DenseLayer N util_functions C NeuralNetwork C adaline N magic_sequence Functions for the Magic sequence implementation N manacher Functions for Manacher's Algorithm implementation ► N math For IO operations N binomial N fibonacci_sum N modular_division N n_bonacci ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p N vector_cross N MD5 Functions for the MD5 algorithm implementation N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N mincoins_topdown Functions for minimum coin exchange problem N Minimum Implementation of Minimum Edit Distance algorithm N modular_division Functions for Modular Division implementation N morse Functions for Morse Code N n_bonacci Functions for the N-bonacci implementation N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N ncr_modulo_p Functions for nCr modulo p implementation N neural_network Neural Network or Multilayer Perceptron N numerical_methods For io operations ► N operations_on_datastructures For std::vector ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ► N others For vector ► N iterative_tree_traversals C BinaryTree Defines the functions associated with the binary tree C Node Defines the structure of a node of the tree ► N lru_cache C LRUCache LRU cache class ► N postfix_expression C Stack Creates an array to be used as stack for storing values N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm ► N probability Probability algorithms ► N geometric_dist C geometric_distribution A class to model the geometric distribution ► N windowed_median C WindowedMedian A class to calculate the median of a leading sliding window at the back of a stream of integer values N qr_algorithm Functions to compute QR decomposition of any rectangular matrix ► N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry N queue_using_array Functions for Queue using Array implementation N radix_sort Functions for Radix sort algorithm N random_pivot_quick_sort Functions for the Random Pivot Quick Sort implementation ► N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C HLD The Heavy-Light Decomposition class C SG Segment Tree , to store heavy chains C Tree A Basic Tree , which supports binary lifting N sparse_table ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/" N runge_kutta Functions for Runge Kutta fourth order method N saddleback Function for implementing Saddleback Algorithm ► N search For std::vector N cycle_detection N median_search N saddleback ► N sublist_search C Node A Node structure representing a single link Node in a linked list N selection_sort_recursive Functions for the Selection sort implementation using recursion N SHA Functions for the SHA-1 algorithm implementation N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Functions for Implementation of Sparse Table N spirograph ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace N chrono N experimental N rel_ops N this_thread C is_arithmetic< uint128_t > C is_arithmetic< uint256_t > C is_integral< uint128_t > C is_integral< uint256_t > C is_unsigned< uint128_t > C is_unsigned< uint256_t > N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N subarray_sum Functions for the Subset sum implementation N sublist_search Functions for the Sublist Search implementation N Subsets Functions for the Subset Sum problem N tree_234 Functions for 2–3–4 tree N trie_operations Functions for Trie datastructure implementation N trie_using_hashmap Functions for Trie data structure using hashmap implementation N util_functions Various utility functions used in Neural network N vector_cross Functions for Vector Cross Product algorithms N vigenere Functions for vigenère cipher algorithm N wave_sort Functions for the Wave sort implementation N wiggle_sort Functions for Wiggle Sort algorithm N wildcard_matching Functions for the Wildcard Matching problem N windowed_median Functions for the Windowed Median algorithm implementation N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm N runge_kutta Functions for Runge Kutta fourth order method N saddleback Function for implementing Saddleback Algorithm ► N search For std::vector N cycle_detection N median_search N saddleback ► N sublist_search C Node A Node structure representing a single link Node in a linked list N selection_sort_recursive Functions for the Selection sort implementation using recursion N SHA Functions for the SHA-1 algorithm implementation N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Functions for Implementation of Sparse Table N spirograph ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace N chrono N experimental N rel_ops N this_thread C is_arithmetic< uint128_t > C is_arithmetic< uint256_t > C is_integral< uint128_t > C is_integral< uint256_t > C is_unsigned< uint128_t > C is_unsigned< uint256_t > N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N subarray_sum Functions for the Subset sum implementation N sublist_search Functions for the Sublist Search implementation N Subsets Functions for the Subset Sum problem N tree_234 Functions for 2–3–4 tree N trie_operations Functions for Trie datastructure implementation N trie_using_hashmap Functions for Trie data structure using hashmap implementation N util_functions Various utility functions used in Neural network N vector_cross Functions for Vector Cross Product algorithms N vigenere Functions for vigenère cipher algorithm N wave_sort Functions for the Wave sort implementation N wiggle_sort Functions for Wiggle Sort algorithm N wildcard_matching Functions for the Wildcard Matching problem N windowed_median Functions for the Windowed Median algorithm implementation N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm 
1.9.2
+