diff --git a/annotated.html b/annotated.html
index 2078d76e6..8038e3958 100644
--- a/annotated.html
+++ b/annotated.html
@@ -153,121 +153,123 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
C HKGraph Represents Bipartite graph for Hopcroft Karp implementation C LowestCommonAncestor C RootedTree ► N hashing Hashing algorithms ► N sha256 C Hash Contains hash array and functions to update it and convert it to a hexadecimal string ► N linear_probing An implementation of hash table using linear probing algorithm C Entry ► 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 k_nearest_neighbors C Knn K-Nearest Neighbors (Knn ) class using Euclidean distance as distance metric ► N neural_network ► N layers C DenseLayer C NeuralNetwork C adaline ► N math For IO operations ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p ► N operations_on_datastructures For std::vector ► N circular_linked_list C CircularLinkedList A class that implements a Circular Linked List C Node A Node struct that represents a single Node in a Binary Tree ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N reverse_binary_tree C BinaryTree A Binary Tree class that implements a Binary Search Tree (BST) by default C Node A Node struct that represents a single node in a Binary Tree ► 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 recursive_tree_traversals C BT BT used to make the entire structure of the binary tree and the functions associated with the binary tree C Node The structure to hold Nodes of the tree ► 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 quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry ► 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 C fenwick_tree The class that initializes the Fenwick Tree ► 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 search For std::vector ► N sublist_search C Node A Node structure representing a single link Node in a linked list ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace 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 strings Algorithms with strings ► N boyer_moore C pattern A structure representing all the data we need to search the preprocessed pattern in text ► C binary_search_tree The Binary Search Tree class C bst_node A struct to represent a node in the Binary Search Tree C Btree C cll C compare C Compare Comparator class for priority queue C Complex Class Complex to represent complex numbers as a field C CycleCheck C double_linked_list C dsu Disjoint sets union data structure, class based representation C EasterYearMonthDay For IO operations C Edge C FCFS Class which implements the FCFS scheduling algorithm C Graph C hash_chain Chain class with a given modulus C Item C large_number C linkedlist C list C ListNode For IO operations C MinHeap C MinHeapNode C mst C Node ► N greedy_algorithms For std::vector C Graph Wrapper class for storing a graph ► N hashing Hashing algorithms ► N sha256 C Hash Contains hash array and functions to update it and convert it to a hexadecimal string ► N linear_probing An implementation of hash table using linear probing algorithm C Entry ► 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 k_nearest_neighbors C Knn K-Nearest Neighbors (Knn ) class using Euclidean distance as distance metric ► N neural_network ► N layers C DenseLayer C NeuralNetwork C adaline ► N math For IO operations ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p ► N operations_on_datastructures For std::vector ► N circular_linked_list C CircularLinkedList A class that implements a Circular Linked List C Node A Node struct that represents a single Node in a Binary Tree ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N reverse_binary_tree C BinaryTree A Binary Tree class that implements a Binary Search Tree (BST) by default C Node A Node struct that represents a single node in a Binary Tree ► 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 recursive_tree_traversals C BT BT used to make the entire structure of the binary tree and the functions associated with the binary tree C Node The structure to hold Nodes of the tree ► 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 quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry ► 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 C fenwick_tree The class that initializes the Fenwick Tree ► 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 search For std::vector ► N sublist_search C Node A Node structure representing a single link Node in a linked list ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace 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 strings Algorithms with strings ► N boyer_moore C pattern A structure representing all the data we need to search the preprocessed pattern in text ► C binary_search_tree The Binary Search Tree class C bst_node A struct to represent a node in the Binary Search Tree C Btree C cll C compare C Compare Comparator class for priority queue C Complex Class Complex to represent complex numbers as a field C CycleCheck C double_linked_list C dsu Disjoint sets union data structure, class based representation C EasterYearMonthDay For IO operations C Edge C FCFS Class which implements the FCFS scheduling algorithm C Graph C hash_chain Chain class with a given modulus C Item C large_number C linkedlist C list C ListNode For IO operations C MinHeap C MinHeapNode C mst C node C Point C query C Queue C queue C RBtree C SegmentIntersection C Solution C stack For std::invalid_argument C stack_linkedList C TestCase Single example inputs and expected output of the function longest_common_string_length C TestCases Class encapsulating the necessary test cases C tower ► C Trie C TrieNode C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer C Node C Point C query C Queue C queue C RBtree C SegmentIntersection C Solution C stack For std::invalid_argument C stack_linkedList C TestCase Single example inputs and expected output of the function longest_common_string_length C TestCases Class encapsulating the necessary test cases C tower ► C Trie C TrieNode C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer FCFS fenwick_tree (range_queries )
G generate_parentheses (backtracking )geometric_distribution (probability::geometric_dist)Graph Graph (graph )Graph (graph::is_graph_bipartite)
+generate_parentheses (backtracking )geometric_distribution (probability::geometric_dist)Graph Graph (graph )Graph (graph::is_graph_bipartite)Graph (greedy_algorithms )
H Hash (hashing::sha256)hash_chain HillCipher (ciphers )HKGraph (graph )HLD (range_queries::heavy_light_decomposition)
@@ -140,7 +140,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
Matrix (divide_and_conquer::strassens_multiplication)MinHeap MinHeapNode mst
N NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures::linked_list)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)Node node Node (operations_on_datastructures::circular_linked_list)Node (operations_on_datastructures::inorder_traversal_of_bst)Node (operations_on_datastructures::reverse_binary_tree)Node (others::iterative_tree_traversals)Node (others::recursive_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
+NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures::linked_list)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)node Node Node (operations_on_datastructures::circular_linked_list)Node (operations_on_datastructures::inorder_traversal_of_bst)Node (operations_on_datastructures::reverse_binary_tree)Node (others::iterative_tree_traversals)Node (others::recursive_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
P pattern (strings::boyer_moore)perSegTree (range_queries )Point (ciphers::elliptic_curve_key_exchange )Point (geometry::grahamscan)Point (geometry::jarvis)Point
diff --git a/d1/d1d/class_graph-members.html b/d1/d1d/class_graph-members.html
index 4851d94b6..85de26cfe 100644
--- a/d1/d1d/class_graph-members.html
+++ b/d1/d1d/class_graph-members.html
@@ -107,26 +107,24 @@ $(document).ready(function(){initNavTree('da/d9a/class_graph.html','../../'); in
addEdge (int src, int dst, int weight) (defined in Graph )Graph inline addEdge (Edge const &edge)Graph inline addEdge (unsigned int source, unsigned int destination)Graph inline addEdge (int src, int dst, int weight) (defined in Graph )Graph inline addVertices (unsigned int num=1)Graph inline bfs (int source, int sink) (defined in Graph )Graph inline private capacity (defined in Graph )Graph private edge_participated (defined in Graph )Graph private edgeNum (defined in Graph )Graph edges (defined in Graph )Graph addVertices (unsigned int num=1)Graph inline bfs (int source, int sink) (defined in Graph )Graph inline private capacity (defined in Graph )Graph private edge_participated (defined in Graph )Graph private edgeNum (defined in Graph )Graph edges (defined in Graph )Graph ford_fulkerson () (defined in Graph )Graph inline getAdjList () constGraph inline getVertices () constGraph inline Graph (int V, int E) (defined in Graph )Graph inline Graph (int V) (defined in Graph )Graph inline Graph () (defined in Graph )Graph inline Graph (Graph &&)=default (defined in Graph )Graph Graph (Graph const &)=default (defined in Graph )Graph Graph (unsigned int vertices, AdjList adjList)Graph inline Graph (unsigned int vertices, AdjList &&adjList)Graph inline Graph (unsigned int vertices, std::vector< Edge > const &edges)Graph inline Graph (const int V) (defined in Graph )Graph inline edges (defined in Graph )Graph ford_fulkerson () (defined in Graph )Graph inline getAdjList () constGraph inline getVertices () constGraph inline Graph (int V, int E) (defined in Graph )Graph inline Graph (int V) (defined in Graph )Graph inline Graph () (defined in Graph )Graph inline Graph (Graph &&)=default (defined in Graph )Graph Graph (Graph const &)=default (defined in Graph )Graph Graph (unsigned int vertices, AdjList adjList)Graph inline Graph (unsigned int vertices, AdjList &&adjList)Graph inline Graph (unsigned int vertices, std::vector< Edge > const &edges)Graph inline m_adjList (defined in Graph )Graph private m_vertices (defined in Graph )Graph private max_flow (defined in Graph )Graph private
+
diff --git a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.md5 b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.md5
new file mode 100644
index 000000000..4d9433c21
--- /dev/null
+++ b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.md5
@@ -0,0 +1 @@
+02dec7afa6ff871d850c576454a9fbec
\ No newline at end of file
diff --git a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.svg b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.svg
new file mode 100644
index 000000000..1c29db867
--- /dev/null
+++ b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl.svg
@@ -0,0 +1,118 @@
+
+
+
+
+
+
+
+
+
+
+
+greedy_algorithms/dijkstra.cpp
+
+
+Node1
+
+greedy_algorithms/dijkstra.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+climits
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+vector
+
+
+
+
+Node1->Node5
+
+
+
+
+
+
+
+
+
+
diff --git a/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl_org.svg b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl_org.svg
new file mode 100644
index 000000000..32863f115
--- /dev/null
+++ b/d2/d48/greedy__algorithms_2dijkstra_8cpp__incl_org.svg
@@ -0,0 +1,93 @@
+
+
+
+
+
+
+greedy_algorithms/dijkstra.cpp
+
+
+Node1
+
+greedy_algorithms/dijkstra.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+climits
+
+
+
+
+Node1->Node3
+
+
+
+
+
+Node4
+
+iostream
+
+
+
+
+Node1->Node4
+
+
+
+
+
+Node5
+
+vector
+
+
+
+
+Node1->Node5
+
+
+
+
+
diff --git a/d2/d90/namespacegreedy__algorithms.html b/d2/d90/namespacegreedy__algorithms.html
index 6232127ab..7e5ff2c72 100644
--- a/d2/d90/namespacegreedy__algorithms.html
+++ b/d2/d90/namespacegreedy__algorithms.html
@@ -98,6 +98,7 @@ $(document).ready(function(){initNavTree('d2/d90/namespacegreedy__algorithms.htm
@@ -106,8 +107,23 @@ $(document).ready(function(){initNavTree('d2/d90/namespacegreedy__algorithms.htm
for std::vector
More...
+class Graph Wrapper class for storing a graph. More...
int minimum_distance (std::vector < int > mdist, std::vector < bool > vset, int V) Utility function that finds the vertex with the minimum distance in mdist. void print (std::vector < int > dist, int V) Utility function to print the distances to vertices. void dijkstra (Graph graph, int src) The main function that finds the shortest path from given source to all other vertices using Dijkstra's Algorithm. template<typename T > void findMinimumEdge (const int &infinity, const std::array < std::array < T, 6 >, 6 > &graph) Finds the minimum edge of the given graph. for assert for INT_MAX for IO operations
Greedy Algorithms
+◆
+
+
+
+ void greedy_algorithms::dijkstra
+ (
+ Graph graph ,
+
+ int
+ src
+
+ )
+
+
+
+
+
The main function that finds the shortest path from given source to all other vertices using Dijkstra's Algorithm.
+
Note This doesn't work on negative weights.
+
Parameters
+
+ graph the graph to be processed src the source of the given vertex
+
+
+
Returns void
+
122 {
+
123 int V =
graph .vertexNum;
+
+
+
126
+
127
+
128 for (int i = 0; i < V; i++) {
+
129 mdist[i] = INT_MAX;
+
130 vset[i] = false ;
+
131 }
+
132
+
133 mdist[src] = 0;
+
134
+
135
+
136 for (int count = 0; count < V - 1; count++) {
+
+
138
+
139 vset[u] = true ;
+
140
+
141 for (int v = 0; v < V; v++) {
+
142 if (!vset[v] &&
graph .edges[u][v] &&
+
143 mdist[u] +
graph .edges[u][v] < mdist[v]) {
+
144 mdist[v] = mdist[u] +
graph .edges[u][v];
+
145 }
+
146 }
+
147 }
+
148
+
149 print(mdist, V);
+
150 }
+
+
int minimum_distance(std::vector< int > mdist, std::vector< bool > vset, int V)
Utility function that finds the vertex with the minimum distance in mdist.
Definition dijkstra.cpp:80
+
+
+
+
+
+
◆ 49 }
50 }
-
+
+
+
+◆
+
+
+
+ int greedy_algorithms::minimum_distance
+ (
+ std::vector < int > mdist ,
+
+ std::vector < bool > vset ,
+
+ int
+ V
+
+ )
+
+
+
+
+
Utility function that finds the vertex with the minimum distance in mdist.
+
Parameters
+
+ mdist array of distances to each vertex vset array indicating inclusion in the shortest path tree V the number of vertices in the graph
+
+
+
Returns index of the vertex with the minimum distance
+
80 {
+
81 int minVal = INT_MAX, minInd = 0;
+
82 for (int i = 0; i < V; i++) {
+
83 if (!vset[i] && (mdist[i] < minVal)) {
+
84 minVal = mdist[i];
+
85 minInd = i;
+
86 }
+
87 }
+
88
+
89 return minInd;
+
90 }
+
+
+
◆
+
+
+
+ void greedy_algorithms::print
+ (
+ std::vector < int > dist ,
+
+ int
+ V
+
+ )
+
+
+
+
+
Utility function to print the distances to vertices.
+
This function prints the distances to each vertex in a tabular format. If the distance is equal to INT_MAX, it is displayed as "INF".
+
Parameters
+
+ dist An array representing the distances to each vertex. V The number of vertices in the graph.
+
+
+
Returns void
+
102 {
+
+
104 for (int i = 0; i < V; i++) {
+
105 if (dist[i] < INT_MAX) {
+
106 std::cout << i <<
"\t" << dist[i] <<
"\n" ;
+
107 }
+
108 else {
+
+
110 }
+
111 }
+
112 }
+
diff --git a/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph.md5 b/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph.md5
new file mode 100644
index 000000000..f2dce1810
--- /dev/null
+++ b/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph.md5
@@ -0,0 +1 @@
+71fe9b525842bd99a7a6946655346aa7
\ No newline at end of file
diff --git a/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph.svg b/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph.svg
new file mode 100644
index 000000000..5e018911a
--- /dev/null
+++ b/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph.svg
@@ -0,0 +1,66 @@
+
+
+
+
+
+
+
+
+
+
+
+greedy_algorithms::dijkstra
+
+
+Node1
+
+greedy_algorithms::
+dijkstra
+
+
+
+
+Node2
+
+greedy_algorithms::
+minimum_distance
+
+
+
+
+Node1->Node2
+
+
+
+
+
+
+
+
+
+
diff --git a/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph_org.svg b/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph_org.svg
new file mode 100644
index 000000000..b6d4a3dff
--- /dev/null
+++ b/d2/d90/namespacegreedy__algorithms_a04a39ac70bceeab6bcd3073da760e88a_cgraph_org.svg
@@ -0,0 +1,41 @@
+
+
+
+
+
+
+greedy_algorithms::dijkstra
+
+
+Node1
+
+greedy_algorithms::
+dijkstra
+
+
+
+
+Node2
+
+greedy_algorithms::
+minimum_distance
+
+
+
+
+Node1->Node2
+
+
+
+
+
diff --git a/d3/d64/classgreedy__algorithms_1_1_graph.html b/d3/d64/classgreedy__algorithms_1_1_graph.html
new file mode 100644
index 000000000..c98ff4be0
--- /dev/null
+++ b/d3/d64/classgreedy__algorithms_1_1_graph.html
@@ -0,0 +1,258 @@
+
+
+
+Algorithms_in_C++: greedy_algorithms::Graph Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+
+
+
+
+
Wrapper class for storing a graph.
+ More...
+
+
+
+ Graph (const int V) Constructs a graph. void add_edge (int src, int dst, int weight) Adds an edge to the graph.
+
+
Wrapper class for storing a graph.
+
+
+
◆
+
+
+
+
+
+
+
+
+ greedy_algorithms::Graph::Graph
+ (
+ const int
+ V )
+
+
+
+
+inline explicit
+
+
+
+
+
Constructs a graph.
+
Parameters
+
+ V number of vertices of the graph
+
+
+
42 {
+
43
+
+
45 for (int i = 0; i < V; i++) {
+
+
47 }
+
48
+
49
+
50 for (int i = 0; i < V; i++) {
+
51 for (int j = 0; j < V; j++) {
+
52 edges[i][j] = 0;
+
53 }
+
54 }
+
55
+
56 this->vertexNum = V;
+
57 }
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ void greedy_algorithms::Graph::add_edge
+ (
+ int
+ src ,
+
+ int
+ dst ,
+
+ int
+ weight
+
+ )
+
+
+
+
+inline
+
+
+
+
+
Adds an edge to the graph.
+
Parameters
+
+ src the graph the edge should be added to dst the position where the edge should be added to weight the weight of the edge that should be added
+
+
+
Returns void
+
66 {
+
67 this->edges[src][dst] = weight;
+
68 }
+
+
+
+
The documentation for this class was generated from the following file:
+
+
Algorithms_in_C++: Member List
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+
+
+
+
+
This is the complete list of members for greedy_algorithms::Graph , including all inherited members.
+
+
+
diff --git a/da/d74/classgreedy__algorithms_1_1_graph__coll__graph.md5 b/da/d74/classgreedy__algorithms_1_1_graph__coll__graph.md5
new file mode 100644
index 000000000..6732713d2
--- /dev/null
+++ b/da/d74/classgreedy__algorithms_1_1_graph__coll__graph.md5
@@ -0,0 +1 @@
+26fbf11aad993f1b7a4afbbba05cdff4
\ No newline at end of file
diff --git a/da/d74/classgreedy__algorithms_1_1_graph__coll__graph.svg b/da/d74/classgreedy__algorithms_1_1_graph__coll__graph.svg
new file mode 100644
index 000000000..7e1bfb98d
--- /dev/null
+++ b/da/d74/classgreedy__algorithms_1_1_graph__coll__graph.svg
@@ -0,0 +1,67 @@
+
+
+
+
+
+
+
+
+
+
+
+greedy_algorithms::Graph
+
+
+Node1
+
+greedy_algorithms::
+Graph
+
+
+
+
+Node2
+
+std::vector< std::vector
+< int > >
+
+
+
+
+Node2->Node1
+
+
+ edges
+
+
+
+
+
+
+
+
diff --git a/da/d74/classgreedy__algorithms_1_1_graph__coll__graph_org.svg b/da/d74/classgreedy__algorithms_1_1_graph__coll__graph_org.svg
new file mode 100644
index 000000000..ff4cec358
--- /dev/null
+++ b/da/d74/classgreedy__algorithms_1_1_graph__coll__graph_org.svg
@@ -0,0 +1,42 @@
+
+
+
+
+
+
+greedy_algorithms::Graph
+
+
+Node1
+
+greedy_algorithms::
+Graph
+
+
+
+
+Node2
+
+std::vector< std::vector
+< int > >
+
+
+
+
+Node2->Node1
+
+
+ edges
+
+
+
diff --git a/da/d9a/class_graph.html b/da/d9a/class_graph.html
index 29dd23480..1a0e14bb8 100644
--- a/da/d9a/class_graph.html
+++ b/da/d9a/class_graph.html
@@ -156,10 +156,6 @@ Public Member Functions
void print_flow_info () Graph (const int V) void addEdge (int src, int dst, int weight)
vertexNum edgeNum Edge * edges edges max_flow = 0The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" & "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1).
◆ [1/7] ◆ [1/6]
@@ -268,7 +264,7 @@ int
max_flow = 0
◆ [2/7] ◆ [2/6]
@@ -332,7 +328,7 @@ int
max_flow = 0
◆ [3/7] ◆ [3/6]
@@ -358,7 +354,7 @@ int
max_flow = 0
◆ [4/7] ◆ [4/6]
@@ -404,7 +400,7 @@ int
max_flow = 0
◆ [5/7] ◆ [5/6]
@@ -449,7 +445,7 @@ int
max_flow = 0
◆ [6/7] ◆ [6/6]
@@ -503,51 +499,9 @@ int
max_flow = 0
-◆ [7/7]
-
-
-
-
-
-
- Graph::Graph
- (
- const int
- V )
-
-
-
-
-inline
-
-
-
-
13 {
-
14
-
15 this->edges = new int *[V];
-
16 for (int i = 0; i < V; i++) {
-
17 edges[i] = new int [V];
-
18 }
-
19
-
20
-
21 for (int i = 0; i < V; i++) {
-
22 for (int j = 0; j < V; j++) {
-
23 edges[i][j] = 0;
-
24 }
-
25 }
-
26
-
27 this->vertexNum = V;
-
28 }
-
-
-
◆ [1/5] ◆ [1/4]
@@ -586,7 +540,7 @@ int
max_flow = 0
◆ [2/5] ◆ [2/4]
@@ -638,7 +592,7 @@ int
max_flow = 0
◆ [3/5] ◆ [3/4]
@@ -682,53 +636,8 @@ int
max_flow = 0
-◆ [4/5]
-
-
-
-
-
-
- void Graph::addEdge
- (
- int
- src ,
-
- int
- dst ,
-
- int
- weight
-
- )
-
-
-
-
-inline
-
-
-
-
31 {
-
32 this->edges[src][dst] = weight;
-
33 }
-
-
-
◆ [5/5] ◆ [4/4]
@@ -1071,7 +980,6 @@ int
max_flow = 0dynamic_programming/floyd_warshall.cpp
graph/cycle_check_directed_graph.cpp
graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
-greedy_algorithms/dijkstra.cpp
diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp.html b/df/dcb/greedy__algorithms_2dijkstra_8cpp.html
new file mode 100644
index 000000000..ad72704ef
--- /dev/null
+++ b/df/dcb/greedy__algorithms_2dijkstra_8cpp.html
@@ -0,0 +1,264 @@
+
+
+
+Algorithms_in_C++: greedy_algorithms/dijkstra.cpp File Reference
+
+
+
+
+
+
+ Algorithms_in_C++ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+
+
+
+
+
Dijkstra algorithm implementation
+More...
+
#include <cassert>#include <climits>#include <iostream>#include <vector>
+
+
Dijkstra algorithm implementation
+
Quote from Wikipedia.
+
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.
+
Author David Leal
+Arpan Jain
+
+
+
◆
+
+
+
+
+
+ int main
+ (
+ void
+ )
+
+
+
+
+
Main function.
+
Returns 0 on exit
+
196 {
+
+
198 return 0;
+
199 }
+
void tests()
Definition dijkstra.cpp:113
+
+
+
+
+
+
+
◆
+
+
+
+
+
+
+
+
+ static void tests
+ (
+ )
+
+
+
+
+static
+
+
+
+
+
Self-test implementations.
+
Returns void
+
157 {
+
+
159
+
160
+
161 graph .add_edge(6, 2, 4);
+
162 graph .add_edge(2, 6, 4);
+
163
+
164 assert(
graph .edges[6][2] == 4);
+
165
+
166
+
167 graph .add_edge(0, 1, 1);
+
168 graph .add_edge(1, 0, 1);
+
169
+
170 assert(
graph .edges[0][1] == 1);
+
171
+
172
+
173 graph .add_edge(0, 2, 7);
+
174 graph .add_edge(2, 0, 7);
+
175 graph .add_edge(1, 2, 1);
+
176 graph .add_edge(2, 1, 1);
+
177
+
178 assert(
graph .edges[0][2] == 7);
+
179
+
180
+
181 graph .add_edge(1, 3, 3);
+
182 graph .add_edge(3, 1, 3);
+
183 graph .add_edge(1, 4, 2);
+
184 graph .add_edge(4, 1, 2);
+
185 graph .add_edge(2, 3, 2);
+
186
+
187 assert(
graph .edges[1][3] == 3);
+
188
+
189 std::cout <<
"All tests have successfully passed!\n" ;
+
190 }
+
+
Wrapper class for storing a graph.
Definition dijkstra.cpp:33
+
+
+
+
+
+
+
diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 000000000..afe3b2eff
--- /dev/null
+++ b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+1edcd48bfe806bcce7094807255da485
\ No newline at end of file
diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 000000000..876e455c9
--- /dev/null
+++ b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,228 @@
+
+
+
+
+
+
+
+
+
+
+
+main
+
+
+Node1
+
+main
+
+
+
+
+Node2
+
+tests
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+graph::addEdge
+
+
+
+
+Node2->Node3
+
+
+
+
+
+Node4
+
+graph::dijkstra
+
+
+
+
+Node2->Node4
+
+
+
+
+
+Node11
+
+std::endl
+
+
+
+
+Node2->Node11
+
+
+
+
+
+Node5
+
+std::priority_queue
+::empty
+
+
+
+
+Node4->Node5
+
+
+
+
+
+Node6
+
+std::make_pair
+
+
+
+
+Node4->Node6
+
+
+
+
+
+Node7
+
+std::priority_queue::pop
+
+
+
+
+Node4->Node7
+
+
+
+
+
+Node8
+
+std::priority_queue
+::push
+
+
+
+
+Node4->Node8
+
+
+
+
+
+Node9
+
+std::vector::size
+
+
+
+
+Node4->Node9
+
+
+
+
+
+Node10
+
+std::priority_queue::top
+
+
+
+
+Node4->Node10
+
+
+
+
+
+
+
+
+
+
diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
new file mode 100644
index 000000000..c82606f38
--- /dev/null
+++ b/df/dcb/greedy__algorithms_2dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
@@ -0,0 +1,203 @@
+
+
+
+
+
+
+main
+
+
+Node1
+
+main
+
+
+
+
+Node2
+
+tests
+
+
+
+
+Node1->Node2
+
+
+
+
+
+Node3
+
+graph::addEdge
+
+
+
+
+Node2->Node3
+
+
+
+
+
+Node4
+
+graph::dijkstra
+
+
+
+
+Node2->Node4
+
+
+
+
+
+Node11
+
+std::endl
+
+
+
+
+Node2->Node11
+
+
+
+
+
+Node5
+
+std::priority_queue
+::empty
+
+
+
+
+Node4->Node5
+
+
+
+
+
+Node6
+
+std::make_pair
+
+
+
+
+Node4->Node6
+
+
+
+
+
+Node7
+
+std::priority_queue::pop
+
+
+
+
+Node4->Node7
+
+
+
+
+
+Node8
+
+std::priority_queue
+::push
+
+
+
+
+Node4->Node8
+
+
+
+
+
+Node9
+
+std::vector::size
+
+
+
+
+Node4->Node9
+
+
+
+
+
+Node10
+
+std::priority_queue::top
+
+
+
+
+Node4->Node10
+
+
+
+
+
diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html
index 88b272ccb..501b2a5b5 100644
--- a/dir_0eaa691bd54ab0922ca7f50599de6d22.html
+++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html
@@ -106,6 +106,9 @@ Files
boruvkas_minimum_spanning_tree.cpp [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm ) to find the Minimum Spanning Tree dijkstra.cpp Dijkstra algorithm implementation jumpgame.cpp Implementation of an algorithm to solve the jumping game problem. 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 jumpgame.cpp Implementation of an algorithm to solve the jumping game problem kruskals_minimum_spanning_tree.cpp Kruskals Minimum Spanning Tree implementation dijkstra.cpp Dijkstra algorithm implementation jumpgame.cpp Implementation of an algorithm to solve the jumping game problem 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 adaline() : machine_learning::adaline
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 > , range_queries::heavy_light_decomposition::Tree< X >
+add_edge() : graph::Graph< T > , greedy_algorithms::Graph , range_queries::heavy_light_decomposition::Tree< X >
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 df37276eb..2f6e47aca 100644
--- a/functions_func_a.html
+++ b/functions_func_a.html
@@ -106,7 +106,7 @@ $(document).ready(function(){initNavTree('functions_func_a.html',''); initResiza
adaline() : machine_learning::adaline
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 > , range_queries::heavy_light_decomposition::Tree< X >
+add_edge() : graph::Graph< T > , greedy_algorithms::Graph , range_queries::heavy_light_decomposition::Tree< X >
addEdge() : Graph , graph::HKGraph , graph::is_graph_bipartite::Graph
addProcess() : FCFS< S, T, E >
addVertices() : Graph
diff --git a/functions_func_g.html b/functions_func_g.html
index 77b51fe50..b69e48207 100644
--- a/functions_func_g.html
+++ b/functions_func_g.html
@@ -149,7 +149,7 @@ $(document).ready(function(){initNavTree('functions_func_g.html',''); initResiza
GetTreeMaxItem() : data_structures::tree_234::Tree234
GetTreeMinItem() : data_structures::tree_234::Tree234
getVertices() : Graph
-Graph() : Graph , graph::Graph< T > , graph::is_graph_bipartite::Graph
+Graph() : Graph , graph::Graph< T > , graph::is_graph_bipartite::Graph , greedy_algorithms::Graph
diff --git a/functions_g.html b/functions_g.html
index ec7176301..5836ee697 100644
--- a/functions_g.html
+++ b/functions_g.html
@@ -150,7 +150,7 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable()
GetTreeMinItem() : data_structures::tree_234::Tree234
getVertices() : Graph
good_suffix : strings::boyer_moore::pattern
-Graph() : Graph , graph::Graph< T > , graph::is_graph_bipartite::Graph
+Graph() : Graph , graph::Graph< T > , graph::is_graph_bipartite::Graph , greedy_algorithms::Graph
diff --git a/globals_func_m.html b/globals_func_m.html
index 429f448ca..065c03bde 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
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 , 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 , jumpgame.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 , ncr_modulo_p.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 , lru_cache.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 , 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 , 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 , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.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 , horspool.cpp , knuth_morris_pratt.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 , 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 , dijkstra.cpp , jumpgame.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 , ncr_modulo_p.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 , lru_cache.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 , 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 , 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 , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.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 , horspool.cpp , knuth_morris_pratt.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_s.html b/globals_func_s.html
index 8adb167a7..c3f2a5f92 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -111,8 +111,8 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
show_array() : bogo_sort.cpp
show_data() : shell_sort2.cpp
show_pascal() : pascal_triangle.cpp
-Sieve() : primes_up_to_billion.cpp
sieve() : sieve_of_eratosthenes.cpp
+Sieve() : primes_up_to_billion.cpp
SieveOfEratosthenes() : prime_factorization.cpp
SLEEP() : memory_game.cpp
sortcol() : fcfs_scheduling.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index a93380eda..a35fc48e1 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -138,7 +138,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
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 , 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 , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , comb_sort.cpp , insertion_sort.cpp , quick_sort.cpp , radix_sort2.cpp , boyer_moore.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 , dijkstra.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 , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , comb_sort.cpp , insertion_sort.cpp , quick_sort.cpp , radix_sort2.cpp , boyer_moore.cpp
TH() : tower_of_hanoi.cpp
tolowerRoman() : decimal_to_roman_numeral.cpp
toupperRoman() : decimal_to_roman_numeral.cpp
diff --git a/globals_i.html b/globals_i.html
index e6c6b9333..7c9ba815d 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -109,9 +109,9 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
InterpolationSearch() : interpolation_search2.cpp
is_happy() : happy_number.cpp
is_square() : ordinary_least_squares_regressor.cpp
+isprime : prime_factorization.cpp
IsPrime() : primality_test.cpp
isPrime() : modular_inverse_fermat_little_theorem.cpp
-isprime : prime_factorization.cpp
it_ternary_search() : ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index 8a587908c..61232edd8 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -100,7 +100,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
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 , 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 , jumpgame.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 , ncr_modulo_p.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 , lru_cache.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 , 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 , 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 , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.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 , horspool.cpp , knuth_morris_pratt.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 , 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 , dijkstra.cpp , jumpgame.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 , ncr_modulo_p.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 , lru_cache.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 , 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 , 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 , comb_sort.cpp , count_inversions.cpp , cycle_sort.cpp , dnf_sort.cpp , gnome_sort.cpp , heap_sort.cpp , insertion_sort.cpp , merge_insertion_sort.cpp , merge_sort.cpp , pancake_sort.cpp , pigeonhole_sort.cpp , quick_sort.cpp , quick_sort_3.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 , horspool.cpp , knuth_morris_pratt.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_s.html b/globals_s.html
index 5ac0913fd..0d138d082 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -111,8 +111,8 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
show_array() : bogo_sort.cpp
show_data() : shell_sort2.cpp
show_pascal() : pascal_triangle.cpp
-Sieve() : primes_up_to_billion.cpp
sieve() : sieve_of_eratosthenes.cpp
+Sieve() : primes_up_to_billion.cpp
SieveOfEratosthenes() : prime_factorization.cpp
SLEEP() : memory_game.cpp
sortcol() : fcfs_scheduling.cpp
diff --git a/globals_t.html b/globals_t.html
index 5321ee0e6..0c3d6bcdd 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -139,7 +139,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
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 , 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 , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , comb_sort.cpp , insertion_sort.cpp , quick_sort.cpp , radix_sort2.cpp , boyer_moore.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 , dijkstra.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 , recursive_tree_traversal.cpp , fenwick_tree.cpp , linear_search.cpp , comb_sort.cpp , insertion_sort.cpp , quick_sort.cpp , radix_sort2.cpp , boyer_moore.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 11645ac2a..27e7f5959 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -139,88 +139,89 @@ This inheritance list is sorted roughly, but not completely, alphabetically: ► C graph::Graph< T > C graph::RootedTree C graph::is_graph_bipartite::Graph Class for representing graph as an adjacency list 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 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 graph::LowestCommonAncestor 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 greedy_algorithms::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 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 graph::LowestCommonAncestor 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 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< 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_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 Trie implementation for small-case English alphabets a-z 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 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 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< 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_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 Trie implementation for small-case English alphabets a-z 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 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 e18913e23..ef2219830 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -36,6 +36,7 @@ var hierarchy =
[ "graph::RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", null ]
] ],
[ "graph::is_graph_bipartite::Graph", "de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html", null ],
+ [ "greedy_algorithms::Graph", "d3/d64/classgreedy__algorithms_1_1_graph.html", null ],
[ "hashing::sha256::Hash", "d6/d84/classhashing_1_1sha256_1_1_hash.html", null ],
[ "hash_chain", "dd/d1c/classhash__chain.html", null ],
[ "ciphers::HillCipher", "d6/d26/classciphers_1_1_hill_cipher.html", null ],
@@ -62,8 +63,8 @@ var hierarchy =
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
- [ "Node< ValueType >", "db/d8b/struct_node.html", null ],
[ "node", "d5/da1/structnode.html", null ],
+ [ "Node< ValueType >", "db/d8b/struct_node.html", null ],
[ "operations_on_datastructures::circular_linked_list::Node", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "operations_on_datastructures::reverse_binary_tree::Node", "d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html", null ],
diff --git a/inherit_graph_100.map b/inherit_graph_100.map
index cd9e94752..453f8f72c 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 2cfb4dbc5..d2b23f2ce 100644
--- a/inherit_graph_100.md5
+++ b/inherit_graph_100.md5
@@ -1 +1 @@
-abd7e48c602c9ba41e00a619e3234e23
\ No newline at end of file
+d6ee5f042479b5982faa79c9932e1b9c
\ No newline at end of file
diff --git a/inherit_graph_100.svg b/inherit_graph_100.svg
index 21b38fc47..d8af89648 100644
--- a/inherit_graph_100.svg
+++ b/inherit_graph_100.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-TestCase
+
+strings::boyer_moore
+::pattern
-
diff --git a/inherit_graph_101.md5 b/inherit_graph_101.md5
index 078c92174..2cfb4dbc5 100644
--- a/inherit_graph_101.md5
+++ b/inherit_graph_101.md5
@@ -1 +1 @@
-a9d8d2a80cdf35dfac76eecdbb209456
\ No newline at end of file
+abd7e48c602c9ba41e00a619e3234e23
\ No newline at end of file
diff --git a/inherit_graph_101.svg b/inherit_graph_101.svg
index cf809da77..21b38fc47 100644
--- a/inherit_graph_101.svg
+++ b/inherit_graph_101.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-TestCases
+
+TestCase
-
diff --git a/inherit_graph_102.md5 b/inherit_graph_102.md5
index 74da2954d..078c92174 100644
--- a/inherit_graph_102.md5
+++ b/inherit_graph_102.md5
@@ -1 +1 @@
-76f1c23145670e75e2e13d0451b74420
\ No newline at end of file
+a9d8d2a80cdf35dfac76eecdbb209456
\ No newline at end of file
diff --git a/inherit_graph_102.svg b/inherit_graph_102.svg
index 42e04e2ec..cf809da77 100644
--- a/inherit_graph_102.svg
+++ b/inherit_graph_102.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-tower
+
+TestCases
-
diff --git a/inherit_graph_103.md5 b/inherit_graph_103.md5
index 94955023c..74da2954d 100644
--- a/inherit_graph_103.md5
+++ b/inherit_graph_103.md5
@@ -1 +1 @@
-845eae9f7c70e50cf22fb926bd9e034b
\ No newline at end of file
+76f1c23145670e75e2e13d0451b74420
\ No newline at end of file
diff --git a/inherit_graph_103.svg b/inherit_graph_103.svg
index 766263d28..42e04e2ec 100644
--- a/inherit_graph_103.svg
+++ b/inherit_graph_103.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Trie
+
+tower
-
diff --git a/inherit_graph_104.md5 b/inherit_graph_104.md5
index 0362b08cb..94955023c 100644
--- a/inherit_graph_104.md5
+++ b/inherit_graph_104.md5
@@ -1 +1 @@
-a8666508fe9ca12fb7281895f580da44
\ No newline at end of file
+845eae9f7c70e50cf22fb926bd9e034b
\ No newline at end of file
diff --git a/inherit_graph_104.svg b/inherit_graph_104.svg
index 00e89be9c..766263d28 100644
--- a/inherit_graph_104.svg
+++ b/inherit_graph_104.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Trie::TrieNode
+
+Trie
-
diff --git a/inherit_graph_105.md5 b/inherit_graph_105.md5
index f04050dca..0362b08cb 100644
--- a/inherit_graph_105.md5
+++ b/inherit_graph_105.md5
@@ -1 +1 @@
-eed75a69314afbb385b920f554ca3c5d
\ No newline at end of file
+a8666508fe9ca12fb7281895f580da44
\ No newline at end of file
diff --git a/inherit_graph_105.svg b/inherit_graph_105.svg
index 4cf914cfa..00e89be9c 100644
--- a/inherit_graph_105.svg
+++ b/inherit_graph_105.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-uint128_t
+
+Trie::TrieNode
-
diff --git a/inherit_graph_106.md5 b/inherit_graph_106.md5
index 8c62d9521..f04050dca 100644
--- a/inherit_graph_106.md5
+++ b/inherit_graph_106.md5
@@ -1 +1 @@
-805bd0d28e53f8af03d7b4e5906cc299
\ No newline at end of file
+eed75a69314afbb385b920f554ca3c5d
\ No newline at end of file
diff --git a/inherit_graph_106.svg b/inherit_graph_106.svg
index 692a2afe4..4cf914cfa 100644
--- a/inherit_graph_106.svg
+++ b/inherit_graph_106.svg
@@ -11,9 +11,9 @@
Node0
-
+
uint256_t
+uint128_t
+
diff --git a/inherit_graph_107.md5 b/inherit_graph_107.md5
new file mode 100644
index 000000000..8c62d9521
--- /dev/null
+++ b/inherit_graph_107.md5
@@ -0,0 +1 @@
+805bd0d28e53f8af03d7b4e5906cc299
\ No newline at end of file
diff --git a/inherit_graph_107.svg b/inherit_graph_107.svg
new file mode 100644
index 000000000..692a2afe4
--- /dev/null
+++ b/inherit_graph_107.svg
@@ -0,0 +1,21 @@
+
+
+
+
+
+
+Graphical Class Hierarchy
+
+
+Node0
+
+uint256_t
+
+
+
+
diff --git a/inherit_graph_44.map b/inherit_graph_44.map
index 4a0a75c1d..d0b982fd3 100644
--- a/inherit_graph_44.map
+++ b/inherit_graph_44.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_44.md5 b/inherit_graph_44.md5
index 25d4c3ab7..826dc7e71 100644
--- a/inherit_graph_44.md5
+++ b/inherit_graph_44.md5
@@ -1 +1 @@
-5f49bba0e53577a5b75cb5973529bade
\ No newline at end of file
+77a650ccd6f8db3ab8e06c541ed8eb29
\ No newline at end of file
diff --git a/inherit_graph_44.svg b/inherit_graph_44.svg
index c3846be70..2c1884f30 100644
--- a/inherit_graph_44.svg
+++ b/inherit_graph_44.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-hash_chain
+
+greedy_algorithms::
+Graph
-
diff --git a/inherit_graph_45.md5 b/inherit_graph_45.md5
index 055c62354..25d4c3ab7 100644
--- a/inherit_graph_45.md5
+++ b/inherit_graph_45.md5
@@ -1 +1 @@
-6c9571951ecc9353af9c005c0b55ccb6
\ No newline at end of file
+5f49bba0e53577a5b75cb5973529bade
\ No newline at end of file
diff --git a/inherit_graph_45.svg b/inherit_graph_45.svg
index efdf83fd5..c3846be70 100644
--- a/inherit_graph_45.svg
+++ b/inherit_graph_45.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-hashing::sha256::Hash
+
+hash_chain
-
diff --git a/inherit_graph_46.md5 b/inherit_graph_46.md5
index 8a0d2c09e..055c62354 100644
--- a/inherit_graph_46.md5
+++ b/inherit_graph_46.md5
@@ -1 +1 @@
-59139005b32506728fd8d3323cc419fc
\ No newline at end of file
+6c9571951ecc9353af9c005c0b55ccb6
\ No newline at end of file
diff --git a/inherit_graph_46.svg b/inherit_graph_46.svg
index 5858b44c2..efdf83fd5 100644
--- a/inherit_graph_46.svg
+++ b/inherit_graph_46.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Item
+
+hashing::sha256::Hash
-
diff --git a/inherit_graph_47.md5 b/inherit_graph_47.md5
index 704ac465f..8a0d2c09e 100644
--- a/inherit_graph_47.md5
+++ b/inherit_graph_47.md5
@@ -1 +1 @@
-1c1c2c26230468d96731424183714320
\ No newline at end of file
+59139005b32506728fd8d3323cc419fc
\ No newline at end of file
diff --git a/inherit_graph_47.svg b/inherit_graph_47.svg
index 4c5d58bce..5858b44c2 100644
--- a/inherit_graph_47.svg
+++ b/inherit_graph_47.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-large_number
+
+Item
-
diff --git a/inherit_graph_48.md5 b/inherit_graph_48.md5
index 4ea33de34..704ac465f 100644
--- a/inherit_graph_48.md5
+++ b/inherit_graph_48.md5
@@ -1 +1 @@
-aec2bb5e51f511ef7811875e5b768be0
\ No newline at end of file
+1c1c2c26230468d96731424183714320
\ No newline at end of file
diff --git a/inherit_graph_48.svg b/inherit_graph_48.svg
index d7da8a3c7..4c5d58bce 100644
--- a/inherit_graph_48.svg
+++ b/inherit_graph_48.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-linear_probing::Entry
+
+large_number
-
diff --git a/inherit_graph_49.md5 b/inherit_graph_49.md5
index c8d3c2de6..4ea33de34 100644
--- a/inherit_graph_49.md5
+++ b/inherit_graph_49.md5
@@ -1 +1 @@
-8e83f7de99c4092cec0ef9a67422e9cf
\ No newline at end of file
+aec2bb5e51f511ef7811875e5b768be0
\ No newline at end of file
diff --git a/inherit_graph_49.svg b/inherit_graph_49.svg
index 64fd62b34..d7da8a3c7 100644
--- a/inherit_graph_49.svg
+++ b/inherit_graph_49.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-linkedlist
+
+linear_probing::Entry
-
diff --git a/inherit_graph_50.md5 b/inherit_graph_50.md5
index 93a29532d..c8d3c2de6 100644
--- a/inherit_graph_50.md5
+++ b/inherit_graph_50.md5
@@ -1 +1 @@
-affe8d5f7bdf7b59b4a463a955d67294
\ No newline at end of file
+8e83f7de99c4092cec0ef9a67422e9cf
\ No newline at end of file
diff --git a/inherit_graph_50.svg b/inherit_graph_50.svg
index 32bb07f89..64fd62b34 100644
--- a/inherit_graph_50.svg
+++ b/inherit_graph_50.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-list
+
+linkedlist
-
diff --git a/inherit_graph_51.md5 b/inherit_graph_51.md5
index baf616f59..93a29532d 100644
--- a/inherit_graph_51.md5
+++ b/inherit_graph_51.md5
@@ -1 +1 @@
-5045664194b514cfb842bab0686efcc1
\ No newline at end of file
+affe8d5f7bdf7b59b4a463a955d67294
\ No newline at end of file
diff --git a/inherit_graph_51.svg b/inherit_graph_51.svg
index f4d06b044..32bb07f89 100644
--- a/inherit_graph_51.svg
+++ b/inherit_graph_51.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-ListNode
+
+list
-
diff --git a/inherit_graph_52.md5 b/inherit_graph_52.md5
index 407dd187b..baf616f59 100644
--- a/inherit_graph_52.md5
+++ b/inherit_graph_52.md5
@@ -1 +1 @@
-2e8e1d413e495f551e733eb5369a6e2b
\ No newline at end of file
+5045664194b514cfb842bab0686efcc1
\ No newline at end of file
diff --git a/inherit_graph_52.svg b/inherit_graph_52.svg
index ec028ac51..f4d06b044 100644
--- a/inherit_graph_52.svg
+++ b/inherit_graph_52.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-machine_learning::adaline
+
+ListNode
-
diff --git a/inherit_graph_53.md5 b/inherit_graph_53.md5
index aa1a808ba..407dd187b 100644
--- a/inherit_graph_53.md5
+++ b/inherit_graph_53.md5
@@ -1 +1 @@
-7e09d29ef16a8e17f2fc718f7adf3a92
\ No newline at end of file
+2e8e1d413e495f551e733eb5369a6e2b
\ No newline at end of file
diff --git a/inherit_graph_53.svg b/inherit_graph_53.svg
index 19ac00964..ec028ac51 100644
--- a/inherit_graph_53.svg
+++ b/inherit_graph_53.svg
@@ -4,18 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-machine_learning::aystar
-_search::AyStarSearch<
- Puzzle >
+
+machine_learning::adaline
-
diff --git a/inherit_graph_54.md5 b/inherit_graph_54.md5
index 2beb7b996..aa1a808ba 100644
--- a/inherit_graph_54.md5
+++ b/inherit_graph_54.md5
@@ -1 +1 @@
-6ee2bf3fe6c368836de3901609b53267
\ No newline at end of file
+7e09d29ef16a8e17f2fc718f7adf3a92
\ No newline at end of file
diff --git a/inherit_graph_54.svg b/inherit_graph_54.svg
index 23a6009b2..19ac00964 100644
--- a/inherit_graph_54.svg
+++ b/inherit_graph_54.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+machine_learning::aystar
_search::AyStarSearch<
- Puzzle >::comparison_operator
+ Puzzle >
-
diff --git a/inherit_graph_55.md5 b/inherit_graph_55.md5
index 15d4e0a9b..2beb7b996 100644
--- a/inherit_graph_55.md5
+++ b/inherit_graph_55.md5
@@ -1 +1 @@
-3d686ef3c6aeac1f7d55534f2c7df929
\ No newline at end of file
+6ee2bf3fe6c368836de3901609b53267
\ No newline at end of file
diff --git a/inherit_graph_55.svg b/inherit_graph_55.svg
index 9383b2143..23a6009b2 100644
--- a/inherit_graph_55.svg
+++ b/inherit_graph_55.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+machine_learning::aystar
_search::AyStarSearch<
- Puzzle >::Info
+ Puzzle >::comparison_operator
-
diff --git a/inherit_graph_56.md5 b/inherit_graph_56.md5
index d1b3bc11e..15d4e0a9b 100644
--- a/inherit_graph_56.md5
+++ b/inherit_graph_56.md5
@@ -1 +1 @@
-c9067724c2b1307aad5f178edfcc951c
\ No newline at end of file
+3d686ef3c6aeac1f7d55534f2c7df929
\ No newline at end of file
diff --git a/inherit_graph_56.svg b/inherit_graph_56.svg
index fcc0eddae..9383b2143 100644
--- a/inherit_graph_56.svg
+++ b/inherit_graph_56.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_57.md5 b/inherit_graph_57.md5
index d2de7adcd..d1b3bc11e 100644
--- a/inherit_graph_57.md5
+++ b/inherit_graph_57.md5
@@ -1 +1 @@
-b1ff3363dccc06e01bf09a11d629f080
\ No newline at end of file
+c9067724c2b1307aad5f178edfcc951c
\ No newline at end of file
diff --git a/inherit_graph_57.svg b/inherit_graph_57.svg
index bf7b6cb98..fcc0eddae 100644
--- a/inherit_graph_57.svg
+++ b/inherit_graph_57.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_58.md5 b/inherit_graph_58.md5
index 405905162..d2de7adcd 100644
--- a/inherit_graph_58.md5
+++ b/inherit_graph_58.md5
@@ -1 +1 @@
-2be97cdbdd926a8024864809bee4bdff
\ No newline at end of file
+b1ff3363dccc06e01bf09a11d629f080
\ No newline at end of file
diff --git a/inherit_graph_58.svg b/inherit_graph_58.svg
index 86d6d792f..bf7b6cb98 100644
--- a/inherit_graph_58.svg
+++ b/inherit_graph_58.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_59.md5 b/inherit_graph_59.md5
index 49caa851a..405905162 100644
--- a/inherit_graph_59.md5
+++ b/inherit_graph_59.md5
@@ -1 +1 @@
-3a287905d5fc786607b16577afc8577a
\ No newline at end of file
+2be97cdbdd926a8024864809bee4bdff
\ No newline at end of file
diff --git a/inherit_graph_59.svg b/inherit_graph_59.svg
index 3ca109f40..86d6d792f 100644
--- a/inherit_graph_59.svg
+++ b/inherit_graph_59.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+machine_learning::neural
-_network::NeuralNetwork
+_network::layers::DenseLayer
-
diff --git a/inherit_graph_60.md5 b/inherit_graph_60.md5
index cec1fc052..49caa851a 100644
--- a/inherit_graph_60.md5
+++ b/inherit_graph_60.md5
@@ -1 +1 @@
-43af52015ea93acc511116e0c0f11118
\ No newline at end of file
+3a287905d5fc786607b16577afc8577a
\ No newline at end of file
diff --git a/inherit_graph_60.svg b/inherit_graph_60.svg
index e9c24db7c..3ca109f40 100644
--- a/inherit_graph_60.svg
+++ b/inherit_graph_60.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-math::ncr_modulo_p
-::NCRModuloP
+
+machine_learning::neural
+_network::NeuralNetwork
-
diff --git a/inherit_graph_61.md5 b/inherit_graph_61.md5
index 489e9bbb3..cec1fc052 100644
--- a/inherit_graph_61.md5
+++ b/inherit_graph_61.md5
@@ -1 +1 @@
-e46778d68f07b3d0f85c1a830a98dc2f
\ No newline at end of file
+43af52015ea93acc511116e0c0f11118
\ No newline at end of file
diff --git a/inherit_graph_61.svg b/inherit_graph_61.svg
index 7a9f79a69..e9c24db7c 100644
--- a/inherit_graph_61.svg
+++ b/inherit_graph_61.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-MinHeap
+
+math::ncr_modulo_p
+::NCRModuloP
-
diff --git a/inherit_graph_62.md5 b/inherit_graph_62.md5
index 01a90fbec..489e9bbb3 100644
--- a/inherit_graph_62.md5
+++ b/inherit_graph_62.md5
@@ -1 +1 @@
-cf8942ba7ef89dd77e0e92d576486218
\ No newline at end of file
+e46778d68f07b3d0f85c1a830a98dc2f
\ No newline at end of file
diff --git a/inherit_graph_62.svg b/inherit_graph_62.svg
index 4ab24ecf9..7a9f79a69 100644
--- a/inherit_graph_62.svg
+++ b/inherit_graph_62.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-MinHeapNode
+
+MinHeap
-
diff --git a/inherit_graph_63.md5 b/inherit_graph_63.md5
index febc905f0..01a90fbec 100644
--- a/inherit_graph_63.md5
+++ b/inherit_graph_63.md5
@@ -1 +1 @@
-af810061f564e6fde90b0872fbea4b5a
\ No newline at end of file
+cf8942ba7ef89dd77e0e92d576486218
\ No newline at end of file
diff --git a/inherit_graph_63.svg b/inherit_graph_63.svg
index ae02aa59e..4ab24ecf9 100644
--- a/inherit_graph_63.svg
+++ b/inherit_graph_63.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-mst
+
+MinHeapNode
-
diff --git a/inherit_graph_64.md5 b/inherit_graph_64.md5
index 440617f0a..febc905f0 100644
--- a/inherit_graph_64.md5
+++ b/inherit_graph_64.md5
@@ -1 +1 @@
-0f4a65424288e970abb85f1f24c4b68d
\ No newline at end of file
+af810061f564e6fde90b0872fbea4b5a
\ No newline at end of file
diff --git a/inherit_graph_64.svg b/inherit_graph_64.svg
index 70802f846..ae02aa59e 100644
--- a/inherit_graph_64.svg
+++ b/inherit_graph_64.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-node
+
+mst
-
diff --git a/inherit_graph_65.md5 b/inherit_graph_65.md5
index dc9b5b8bf..440617f0a 100644
--- a/inherit_graph_65.md5
+++ b/inherit_graph_65.md5
@@ -1 +1 @@
-31d376f965d0c96100f12c992693f97f
\ No newline at end of file
+0f4a65424288e970abb85f1f24c4b68d
\ No newline at end of file
diff --git a/inherit_graph_65.svg b/inherit_graph_65.svg
index 7b711ba01..70802f846 100644
--- a/inherit_graph_65.svg
+++ b/inherit_graph_65.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Node< value_type >
+
+node
-
diff --git a/inherit_graph_66.md5 b/inherit_graph_66.md5
index c1ac1eff6..dc9b5b8bf 100644
--- a/inherit_graph_66.md5
+++ b/inherit_graph_66.md5
@@ -1 +1 @@
-b2fca7f12e3a51e27d18b20b6219a04b
\ No newline at end of file
+31d376f965d0c96100f12c992693f97f
\ No newline at end of file
diff --git a/inherit_graph_66.svg b/inherit_graph_66.svg
index e01b32586..7b711ba01 100644
--- a/inherit_graph_66.svg
+++ b/inherit_graph_66.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-Node< ValueType >
+Node< value_type >
diff --git a/inherit_graph_67.map b/inherit_graph_67.map
index 79dd2ded3..48ed6242d 100644
--- a/inherit_graph_67.map
+++ b/inherit_graph_67.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_67.md5 b/inherit_graph_67.md5
index 748751e2b..c1ac1eff6 100644
--- a/inherit_graph_67.md5
+++ b/inherit_graph_67.md5
@@ -1 +1 @@
-519b1f1f6d9604681fda7db93369d107
\ No newline at end of file
+b2fca7f12e3a51e27d18b20b6219a04b
\ No newline at end of file
diff --git a/inherit_graph_67.svg b/inherit_graph_67.svg
index a9f2bdb0a..e01b32586 100644
--- a/inherit_graph_67.svg
+++ b/inherit_graph_67.svg
@@ -4,18 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-operations_on_datastructures
-::circular_linked_list::Circular
-LinkedList
+
+Node< ValueType >
-
diff --git a/inherit_graph_68.md5 b/inherit_graph_68.md5
index e84ffc32c..748751e2b 100644
--- a/inherit_graph_68.md5
+++ b/inherit_graph_68.md5
@@ -1 +1 @@
-89867a2820e6afc3445e0931972f19f8
\ No newline at end of file
+519b1f1f6d9604681fda7db93369d107
\ No newline at end of file
diff --git a/inherit_graph_68.svg b/inherit_graph_68.svg
index 297f946bb..a9f2bdb0a 100644
--- a/inherit_graph_68.svg
+++ b/inherit_graph_68.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_69.md5 b/inherit_graph_69.md5
index e5ef142d1..e84ffc32c 100644
--- a/inherit_graph_69.md5
+++ b/inherit_graph_69.md5
@@ -1 +1 @@
-de5e2e2f4dd5ebd06ad08fa01be3112a
\ No newline at end of file
+89867a2820e6afc3445e0931972f19f8
\ No newline at end of file
diff --git a/inherit_graph_69.svg b/inherit_graph_69.svg
index 19d8d4619..297f946bb 100644
--- a/inherit_graph_69.svg
+++ b/inherit_graph_69.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_70.md5 b/inherit_graph_70.md5
index 924907713..e5ef142d1 100644
--- a/inherit_graph_70.md5
+++ b/inherit_graph_70.md5
@@ -1 +1 @@
-711a97321669830ce7337fbf526fa364
\ No newline at end of file
+de5e2e2f4dd5ebd06ad08fa01be3112a
\ No newline at end of file
diff --git a/inherit_graph_70.svg b/inherit_graph_70.svg
index c172f6758..19d8d4619 100644
--- a/inherit_graph_70.svg
+++ b/inherit_graph_70.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_71.md5 b/inherit_graph_71.md5
index 4c8159bc4..924907713 100644
--- a/inherit_graph_71.md5
+++ b/inherit_graph_71.md5
@@ -1 +1 @@
-7ee46acf738ef592e7c5872c51a2b412
\ No newline at end of file
+711a97321669830ce7337fbf526fa364
\ No newline at end of file
diff --git a/inherit_graph_71.svg b/inherit_graph_71.svg
index 89f62c75c..c172f6758 100644
--- a/inherit_graph_71.svg
+++ b/inherit_graph_71.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_72.md5 b/inherit_graph_72.md5
index cdaa3c84f..4c8159bc4 100644
--- a/inherit_graph_72.md5
+++ b/inherit_graph_72.md5
@@ -1 +1 @@
-95f13092f90a17991418f843e09549cc
\ No newline at end of file
+7ee46acf738ef592e7c5872c51a2b412
\ No newline at end of file
diff --git a/inherit_graph_72.svg b/inherit_graph_72.svg
index d76140766..89f62c75c 100644
--- a/inherit_graph_72.svg
+++ b/inherit_graph_72.svg
@@ -11,10 +11,10 @@
Node0
-
+
operations_on_datastructures
-::trie_operations::Tnode
+::reverse_binary_tree::Node
-
diff --git a/inherit_graph_73.md5 b/inherit_graph_73.md5
index e4d240c66..cdaa3c84f 100644
--- a/inherit_graph_73.md5
+++ b/inherit_graph_73.md5
@@ -1 +1 @@
-86a9f12a6fa0147840e866fbeb575055
\ No newline at end of file
+95f13092f90a17991418f843e09549cc
\ No newline at end of file
diff --git a/inherit_graph_73.svg b/inherit_graph_73.svg
index 0637a1652..d76140766 100644
--- a/inherit_graph_73.svg
+++ b/inherit_graph_73.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::iterative_tree
-_traversals::BinaryTree
+
+operations_on_datastructures
+::trie_operations::Tnode
-
diff --git a/inherit_graph_74.md5 b/inherit_graph_74.md5
index 034ef82f1..e4d240c66 100644
--- a/inherit_graph_74.md5
+++ b/inherit_graph_74.md5
@@ -1 +1 @@
-c4e403fe3e48d0c7ab58a940c6c5c0b2
\ No newline at end of file
+86a9f12a6fa0147840e866fbeb575055
\ No newline at end of file
diff --git a/inherit_graph_74.svg b/inherit_graph_74.svg
index fd1cf78a0..0637a1652 100644
--- a/inherit_graph_74.svg
+++ b/inherit_graph_74.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-
+others::iterative_tree
-_traversals::Node
+_traversals::BinaryTree
-
diff --git a/inherit_graph_75.md5 b/inherit_graph_75.md5
index 8ea66fcc3..034ef82f1 100644
--- a/inherit_graph_75.md5
+++ b/inherit_graph_75.md5
@@ -1 +1 @@
-c57f59e02cf53191d7fc08844b9be12f
\ No newline at end of file
+c4e403fe3e48d0c7ab58a940c6c5c0b2
\ No newline at end of file
diff --git a/inherit_graph_75.svg b/inherit_graph_75.svg
index 269636897..fd1cf78a0 100644
--- a/inherit_graph_75.svg
+++ b/inherit_graph_75.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::lru_cache::
-LRUCache
+
+others::iterative_tree
+_traversals::Node
-
diff --git a/inherit_graph_76.md5 b/inherit_graph_76.md5
index b16955cf8..8ea66fcc3 100644
--- a/inherit_graph_76.md5
+++ b/inherit_graph_76.md5
@@ -1 +1 @@
-3cf038b6307ab2b4487f41674605276b
\ No newline at end of file
+c57f59e02cf53191d7fc08844b9be12f
\ No newline at end of file
diff --git a/inherit_graph_76.svg b/inherit_graph_76.svg
index 70bce1066..269636897 100644
--- a/inherit_graph_76.svg
+++ b/inherit_graph_76.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::postfix_expression
-::Stack
+
+others::lru_cache::
+LRUCache
-
diff --git a/inherit_graph_77.md5 b/inherit_graph_77.md5
index b8ccc104a..b16955cf8 100644
--- a/inherit_graph_77.md5
+++ b/inherit_graph_77.md5
@@ -1 +1 @@
-dae232725c13eb6a5d6f730fcdb228d8
\ No newline at end of file
+3cf038b6307ab2b4487f41674605276b
\ No newline at end of file
diff --git a/inherit_graph_77.svg b/inherit_graph_77.svg
index 54aeac007..70bce1066 100644
--- a/inherit_graph_77.svg
+++ b/inherit_graph_77.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-others::recursive_tree
-_traversals::BT
+
+others::postfix_expression
+::Stack
-
diff --git a/inherit_graph_78.md5 b/inherit_graph_78.md5
index f3256979f..b8ccc104a 100644
--- a/inherit_graph_78.md5
+++ b/inherit_graph_78.md5
@@ -1 +1 @@
-f6de32f06c598964a8bab66bcc4b62a8
\ No newline at end of file
+dae232725c13eb6a5d6f730fcdb228d8
\ No newline at end of file
diff --git a/inherit_graph_78.svg b/inherit_graph_78.svg
index 56db3331c..54aeac007 100644
--- a/inherit_graph_78.svg
+++ b/inherit_graph_78.svg
@@ -11,10 +11,10 @@
Node0
-
+
others::recursive_tree
-_traversals::Node
+_traversals::BT
-
diff --git a/inherit_graph_79.md5 b/inherit_graph_79.md5
index 82f9f0c95..f3256979f 100644
--- a/inherit_graph_79.md5
+++ b/inherit_graph_79.md5
@@ -1 +1 @@
-820705e674915c505f0cb90620ddf48e
\ No newline at end of file
+f6de32f06c598964a8bab66bcc4b62a8
\ No newline at end of file
diff --git a/inherit_graph_79.svg b/inherit_graph_79.svg
index 3a0efdb7d..56db3331c 100644
--- a/inherit_graph_79.svg
+++ b/inherit_graph_79.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-Point
+
+others::recursive_tree
+_traversals::Node
-
diff --git a/inherit_graph_80.md5 b/inherit_graph_80.md5
index 11a68b827..82f9f0c95 100644
--- a/inherit_graph_80.md5
+++ b/inherit_graph_80.md5
@@ -1 +1 @@
-5b7ba5d5b7d5d9feaed21d586b738263
\ No newline at end of file
+820705e674915c505f0cb90620ddf48e
\ No newline at end of file
diff --git a/inherit_graph_80.svg b/inherit_graph_80.svg
index a0700972f..3a0efdb7d 100644
--- a/inherit_graph_80.svg
+++ b/inherit_graph_80.svg
@@ -4,17 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-probability::geometric
-_dist::geometric_distribution
+
+Point
-
diff --git a/inherit_graph_81.md5 b/inherit_graph_81.md5
index 31bf89136..11a68b827 100644
--- a/inherit_graph_81.md5
+++ b/inherit_graph_81.md5
@@ -1 +1 @@
-0f9b5f8b412026fbb732ea3c163679e3
\ No newline at end of file
+5b7ba5d5b7d5d9feaed21d586b738263
\ No newline at end of file
diff --git a/inherit_graph_81.svg b/inherit_graph_81.svg
index d491a738b..a0700972f 100644
--- a/inherit_graph_81.svg
+++ b/inherit_graph_81.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-probability::windowed
-_median::WindowedMedian
+
+probability::geometric
+_dist::geometric_distribution
-
diff --git a/inherit_graph_82.md5 b/inherit_graph_82.md5
index 0976e6802..31bf89136 100644
--- a/inherit_graph_82.md5
+++ b/inherit_graph_82.md5
@@ -1 +1 @@
-878fe0c22ffb95857248a61b2e026f2e
\ No newline at end of file
+0f9b5f8b412026fbb732ea3c163679e3
\ No newline at end of file
diff --git a/inherit_graph_82.svg b/inherit_graph_82.svg
index fe2234bd7..d491a738b 100644
--- a/inherit_graph_82.svg
+++ b/inherit_graph_82.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
Node0
-
-quadratic_probing::
-Entry
+
+probability::windowed
+_median::WindowedMedian
-
diff --git a/inherit_graph_83.md5 b/inherit_graph_83.md5
index f89b9cfcb..0976e6802 100644
--- a/inherit_graph_83.md5
+++ b/inherit_graph_83.md5
@@ -1 +1 @@
-a775ba487438402fd82d2b8c70b24bda
\ No newline at end of file
+878fe0c22ffb95857248a61b2e026f2e
\ No newline at end of file
diff --git a/inherit_graph_83.svg b/inherit_graph_83.svg
index c64a61066..fe2234bd7 100644
--- a/inherit_graph_83.svg
+++ b/inherit_graph_83.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-query
+
+quadratic_probing::
+Entry
-
diff --git a/inherit_graph_84.md5 b/inherit_graph_84.md5
index bb4b76e34..f89b9cfcb 100644
--- a/inherit_graph_84.md5
+++ b/inherit_graph_84.md5
@@ -1 +1 @@
-85445e15a50611e408283d3d7819a158
\ No newline at end of file
+a775ba487438402fd82d2b8c70b24bda
\ No newline at end of file
diff --git a/inherit_graph_84.svg b/inherit_graph_84.svg
index c4d56a8a2..c64a61066 100644
--- a/inherit_graph_84.svg
+++ b/inherit_graph_84.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Queue
+
+query
-
diff --git a/inherit_graph_85.md5 b/inherit_graph_85.md5
index 51a0a6d3f..bb4b76e34 100644
--- a/inherit_graph_85.md5
+++ b/inherit_graph_85.md5
@@ -1 +1 @@
-165dbc62887581bc28e7ac384d7fce79
\ No newline at end of file
+85445e15a50611e408283d3d7819a158
\ No newline at end of file
diff --git a/inherit_graph_85.svg b/inherit_graph_85.svg
index cca1e04c5..c4d56a8a2 100644
--- a/inherit_graph_85.svg
+++ b/inherit_graph_85.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-queue< ValueType >
+
+Queue
-
diff --git a/inherit_graph_86.md5 b/inherit_graph_86.md5
index 58e6b0536..51a0a6d3f 100644
--- a/inherit_graph_86.md5
+++ b/inherit_graph_86.md5
@@ -1 +1 @@
-6b91f80b28512355cc99440d1f709211
\ No newline at end of file
+165dbc62887581bc28e7ac384d7fce79
\ No newline at end of file
diff --git a/inherit_graph_86.svg b/inherit_graph_86.svg
index d1d898703..cca1e04c5 100644
--- a/inherit_graph_86.svg
+++ b/inherit_graph_86.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-range_queries::fenwick_tree
+
+queue< ValueType >
-
diff --git a/inherit_graph_87.md5 b/inherit_graph_87.md5
index 10453adc0..58e6b0536 100644
--- a/inherit_graph_87.md5
+++ b/inherit_graph_87.md5
@@ -1 +1 @@
-63959187ee3e2e3f45b53a6139717dfe
\ No newline at end of file
+6b91f80b28512355cc99440d1f709211
\ No newline at end of file
diff --git a/inherit_graph_87.svg b/inherit_graph_87.svg
index 23cfc5465..d1d898703 100644
--- a/inherit_graph_87.svg
+++ b/inherit_graph_87.svg
@@ -4,58 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-range_queries::heavy
-_light_decomposition
-::SG< X >
-
-
-
-
-Node1
-
-range_queries::heavy
-_light_decomposition
-::HLD< X >
-
-
-
-
-Node0->Node1
-
-
-
-
-
-Node2
-
-range_queries::heavy
-_light_decomposition
-::Tree< X >
-
-
-
-
-Node2->Node1
-
-
+range_queries::fenwick_tree
-
diff --git a/inherit_graph_88.md5 b/inherit_graph_88.md5
index 24cadb1f3..10453adc0 100644
--- a/inherit_graph_88.md5
+++ b/inherit_graph_88.md5
@@ -1 +1 @@
-ee57f6a4fc54bb7c3a6afb895a05fbfe
\ No newline at end of file
+63959187ee3e2e3f45b53a6139717dfe
\ No newline at end of file
diff --git a/inherit_graph_88.svg b/inherit_graph_88.svg
index 4e49c6220..23cfc5465 100644
--- a/inherit_graph_88.svg
+++ b/inherit_graph_88.svg
@@ -4,16 +4,58 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-range_queries::perSegTree
+
+range_queries::heavy
+_light_decomposition
+::SG< X >
+
+
+Node1
+
+range_queries::heavy
+_light_decomposition
+::HLD< X >
+
+
+
+
+Node0->Node1
+
+
+
+
+
+Node2
+
+range_queries::heavy
+_light_decomposition
+::Tree< X >
+
+
+
+
+Node2->Node1
+
+
diff --git a/inherit_graph_89.map b/inherit_graph_89.map
index e1272af9d..ce7850cda 100644
--- a/inherit_graph_89.map
+++ b/inherit_graph_89.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_89.md5 b/inherit_graph_89.md5
index d8ebba9bf..24cadb1f3 100644
--- a/inherit_graph_89.md5
+++ b/inherit_graph_89.md5
@@ -1 +1 @@
-16fb1aa33fafc14e9745334295003576
\ No newline at end of file
+ee57f6a4fc54bb7c3a6afb895a05fbfe
\ No newline at end of file
diff --git a/inherit_graph_89.svg b/inherit_graph_89.svg
index 2f15ef801..4e49c6220 100644
--- a/inherit_graph_89.svg
+++ b/inherit_graph_89.svg
@@ -4,17 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-range_queries::perSegTree
-::Node
+
+range_queries::perSegTree
-
diff --git a/inherit_graph_90.md5 b/inherit_graph_90.md5
index ae285fb9b..d8ebba9bf 100644
--- a/inherit_graph_90.md5
+++ b/inherit_graph_90.md5
@@ -1 +1 @@
-4118d46187a1c497ec1244462bb4e7d1
\ No newline at end of file
+16fb1aa33fafc14e9745334295003576
\ No newline at end of file
diff --git a/inherit_graph_90.svg b/inherit_graph_90.svg
index de5be7383..2f15ef801 100644
--- a/inherit_graph_90.svg
+++ b/inherit_graph_90.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-RBtree
+
+range_queries::perSegTree
+::Node
-
diff --git a/inherit_graph_91.md5 b/inherit_graph_91.md5
index 9bd5c9ecc..ae285fb9b 100644
--- a/inherit_graph_91.md5
+++ b/inherit_graph_91.md5
@@ -1 +1 @@
-d1b903c12342c81b9815dc3248590328
\ No newline at end of file
+4118d46187a1c497ec1244462bb4e7d1
\ No newline at end of file
diff --git a/inherit_graph_91.svg b/inherit_graph_91.svg
index 2f4c87866..de5be7383 100644
--- a/inherit_graph_91.svg
+++ b/inherit_graph_91.svg
@@ -4,17 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-search::sublist_search
-::Node
+
+RBtree
-
diff --git a/inherit_graph_92.md5 b/inherit_graph_92.md5
index 5964d67e1..9bd5c9ecc 100644
--- a/inherit_graph_92.md5
+++ b/inherit_graph_92.md5
@@ -1 +1 @@
-ec8e0ec9ba2659ae4c1c03a14fee656f
\ No newline at end of file
+d1b903c12342c81b9815dc3248590328
\ No newline at end of file
diff --git a/inherit_graph_92.svg b/inherit_graph_92.svg
index d0a223898..2f4c87866 100644
--- a/inherit_graph_92.svg
+++ b/inherit_graph_92.svg
@@ -4,16 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
Node0
-
-SegmentIntersection
+
+search::sublist_search
+::Node
-
diff --git a/inherit_graph_93.md5 b/inherit_graph_93.md5
index 9e4062aa2..5964d67e1 100644
--- a/inherit_graph_93.md5
+++ b/inherit_graph_93.md5
@@ -1 +1 @@
-ff0be17deb0c0dfb25090b34c2c7d14f
\ No newline at end of file
+ec8e0ec9ba2659ae4c1c03a14fee656f
\ No newline at end of file
diff --git a/inherit_graph_93.svg b/inherit_graph_93.svg
index 5d4b15ce4..d0a223898 100644
--- a/inherit_graph_93.svg
+++ b/inherit_graph_93.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-Solution
+
+SegmentIntersection
-
diff --git a/inherit_graph_94.md5 b/inherit_graph_94.md5
index c34364d09..9e4062aa2 100644
--- a/inherit_graph_94.md5
+++ b/inherit_graph_94.md5
@@ -1 +1 @@
-717e385118aaa4f551bc0a7a0954681d
\ No newline at end of file
+ff0be17deb0c0dfb25090b34c2c7d14f
\ No newline at end of file
diff --git a/inherit_graph_94.svg b/inherit_graph_94.svg
index bf6d13f7c..5d4b15ce4 100644
--- a/inherit_graph_94.svg
+++ b/inherit_graph_94.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-stack< ValueType >
+
+Solution
-
diff --git a/inherit_graph_95.md5 b/inherit_graph_95.md5
index 8a3a7c542..c34364d09 100644
--- a/inherit_graph_95.md5
+++ b/inherit_graph_95.md5
@@ -1 +1 @@
-f583284f2e396e0f7b5fd8bccf0bb840
\ No newline at end of file
+717e385118aaa4f551bc0a7a0954681d
\ No newline at end of file
diff --git a/inherit_graph_95.svg b/inherit_graph_95.svg
index cc39a12fe..bf6d13f7c 100644
--- a/inherit_graph_95.svg
+++ b/inherit_graph_95.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-stack_linkedList
+
+stack< ValueType >
-
diff --git a/inherit_graph_96.md5 b/inherit_graph_96.md5
index c8cefab72..8a3a7c542 100644
--- a/inherit_graph_96.md5
+++ b/inherit_graph_96.md5
@@ -1 +1 @@
-adf4423c975497d5fe67f2bb0728f9b9
\ No newline at end of file
+f583284f2e396e0f7b5fd8bccf0bb840
\ No newline at end of file
diff --git a/inherit_graph_96.svg b/inherit_graph_96.svg
index 61bc7cb89..cc39a12fe 100644
--- a/inherit_graph_96.svg
+++ b/inherit_graph_96.svg
@@ -4,16 +4,16 @@
-
+
Graphical Class Hierarchy
Node0
-
-statistics::stats_computer1< T >
+
+stack_linkedList
-
diff --git a/inherit_graph_97.md5 b/inherit_graph_97.md5
index 6a131a0c2..c8cefab72 100644
--- a/inherit_graph_97.md5
+++ b/inherit_graph_97.md5
@@ -1 +1 @@
-efb55af1cccef519836d4c2436ccda42
\ No newline at end of file
+adf4423c975497d5fe67f2bb0728f9b9
\ No newline at end of file
diff --git a/inherit_graph_97.svg b/inherit_graph_97.svg
index 9ff289631..61bc7cb89 100644
--- a/inherit_graph_97.svg
+++ b/inherit_graph_97.svg
@@ -11,9 +11,9 @@
Node0
-
+
statistics::stats_computer2< T >
+statistics::stats_computer1< T >
-
diff --git a/inherit_graph_98.md5 b/inherit_graph_98.md5
index b9994081c..6a131a0c2 100644
--- a/inherit_graph_98.md5
+++ b/inherit_graph_98.md5
@@ -1 +1 @@
-53ba32e546959cac79e584e353db1db7
\ No newline at end of file
+efb55af1cccef519836d4c2436ccda42
\ No newline at end of file
diff --git a/inherit_graph_98.svg b/inherit_graph_98.svg
index bacb8ca83..9ff289631 100644
--- a/inherit_graph_98.svg
+++ b/inherit_graph_98.svg
@@ -4,126 +4,16 @@
-
-
+
+
Graphical Class Hierarchy
1.9.7
+