diff --git a/annotated.html b/annotated.html index b34bb7447..8761670f5 100644 --- a/annotated.html +++ b/annotated.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Class List @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({ - + +
@@ -123,7 +128,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });  CSparse_table  ►Nstack_using_queue  CStackStack Class implementation for basic methods of Stack Data Structure - ►Ntreap + ►NtreapFunctions for the Treap algorithm implementation  CTreapStruct representation of the treap  ►Ntree_234  CNode2-3-4 tree node class @@ -156,7 +161,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });  CLowestCommonAncestor  CRootedTree  ►Ngreedy_algorithmsFor std::vector - ►Ndijkstra + ►NdijkstraFunctions for the Dijkstra algorithm implementation  CGraphWrapper class for storing a graph  ►NhashingHashing algorithms  ►Nsha256 @@ -208,7 +213,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });  CWindowedMedianA class to calculate the median of a leading sliding window at the back of a stream of integer values  ►Nquadratic_probingAn implementation of hash table using quadratic probing algorithm  CEntry - ►Nrange_queriesAlgorithms and Data Structures that support range queries and updates + ►Nrange_queriesFor std::vector  ►Nheavy_light_decomposition  CHLDThe Heavy-Light Decomposition class  CSGSegment Tree, to store heavy chains @@ -229,15 +234,15 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });  Cis_integral< uint256_t >  Cis_unsigned< uint128_t >  Cis_unsigned< uint256_t > - ►NstringsAlgorithms with strings - ►Nboyer_moore + ►NstringsString algorithms + ►Nboyer_mooreFunctions for the Boyer Moore algorithm implementation  CpatternA structure representing all the data we need to search the preprocessed pattern in text  ►Cbinary_search_treeThe Binary Search Tree class  Cbst_nodeA struct to represent a node in the Binary Search Tree  CBtree  Ccll - Ccompare - CCompareComparator class for priority queue + CCompareComparator class for priority queue + Ccompare  CComplexClass Complex to represent complex numbers as a field  CCycleCheck  Cdouble_linked_list @@ -255,18 +260,18 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });  CMinHeap  CMinHeapNode  Cmst - Cnode - CNode + CNode + Cnode  CPoint  Cquery - Cqueue - CQueue + CQueue + Cqueue  CRBtree  CSegmentIntersection  CSolution  CstackFor std::invalid_argument  Cstack_linkedList - CTestCaseSingle example inputs and expected output of the function longest_common_string_length + CTestCaseSingle example inputs and expected output of the function longest_common_string_length  CTestCasesClass encapsulating the necessary test cases  Ctower  ►CTrie @@ -280,7 +285,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(); }); diff --git a/annotated_dup.js b/annotated_dup.js index 1c25f351e..6f5d78c7a 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -27,7 +27,7 @@ var annotated_dup = [ "stack_using_queue", null, [ [ "Stack", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack" ] ] ], - [ "treap", null, [ + [ "treap", "dd/d2e/namespacedata__structures_1_1treap.html", [ [ "Treap", "d5/d95/structdata__structures_1_1treap_1_1_treap.html", "d5/d95/structdata__structures_1_1treap_1_1_treap" ] ] ], [ "tree_234", null, [ @@ -71,7 +71,7 @@ var annotated_dup = [ "RootedTree", "d0/d58/classgraph_1_1_rooted_tree.html", "d0/d58/classgraph_1_1_rooted_tree" ] ] ], [ "greedy_algorithms", "d2/d90/namespacegreedy__algorithms.html", [ - [ "dijkstra", null, [ + [ "dijkstra", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html", [ [ "Graph", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph" ] ] ] ] ], @@ -174,15 +174,15 @@ var annotated_dup = [ "is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ] ] ], [ "strings", "df/dcb/namespacestrings.html", [ - [ "boyer_moore", null, [ + [ "boyer_moore", "d0/dbc/namespacestrings_1_1boyer__moore.html", [ [ "pattern", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern" ] ] ] ] ], [ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ], [ "Btree", "d9/d90/struct_btree.html", null ], [ "cll", "d5/d15/classcll.html", null ], - [ "compare", "d1/db3/structcompare.html", null ], [ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ], + [ "compare", "d1/db3/structcompare.html", null ], [ "Complex", "da/d5a/class_complex.html", "da/d5a/class_complex" ], [ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ], [ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ], @@ -200,12 +200,12 @@ var annotated_dup = [ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ], [ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ], [ "mst", "d1/d77/structmst.html", null ], - [ "node", "d5/da1/structnode.html", null ], [ "Node", "db/d8b/struct_node.html", null ], + [ "node", "d5/da1/structnode.html", null ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], [ "query", "dd/d1b/structquery.html", null ], - [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "Queue", "dc/db5/struct_queue.html", null ], + [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "RBtree", "d8/d72/class_r_btree.html", null ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], [ "Solution", "dd/d4f/class_solution.html", null ], diff --git a/classes.html b/classes.html index c3461be29..16bf09539 100644 --- a/classes.html +++ b/classes.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Class Index @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -112,7 +117,7 @@ $(function(){initNavTree('classes.html',''); initResizable(); });
binary_search_tree
BinaryTree (operations_on_datastructures::reverse_binary_tree)
BinaryTree (others::iterative_tree_traversals)
Bitset (data_structures)
BloomFilter (data_structures)
binary_search_tree::bst_node
BT (others::recursive_tree_traversals)
Btree
C
-
CircularLinkedList (operations_on_datastructures::circular_linked_list)
cll
compare
Compare
AyStarSearch::comparison_operator (machine_learning::aystar_search)
Complex
Convexhull (geometry::jarvis)
CycleCheck
+
CircularLinkedList (operations_on_datastructures::circular_linked_list)
cll
Compare
compare
AyStarSearch::comparison_operator (machine_learning::aystar_search)
Complex
Convexhull (geometry::jarvis)
CycleCheck
D
DenseLayer (machine_learning::neural_network::layers)
double_linked_list
dsu
@@ -124,7 +129,7 @@ $(function(){initNavTree('classes.html',''); initResizable(); });
FCFS
fenwick_tree (range_queries)
G
-
generate_parentheses (backtracking)
geometric_distribution (probability::geometric_dist)
Graph
Graph (graph)
Graph (graph::is_graph_bipartite)
Graph (greedy_algorithms::dijkstra)
+
generate_parentheses (backtracking)
geometric_distribution (probability::geometric_dist)
Graph
Graph (graph)
Graph (graph::is_graph_bipartite)
Graph (greedy_algorithms::dijkstra)
H
Hash (hashing::sha256)
hash_chain
HillCipher (ciphers)
HKGraph (graph)
HLD (range_queries::heavy_light_decomposition)
@@ -142,13 +147,13 @@ $(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 (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)
node
P
-
pattern (strings::boyer_moore)
perSegTree (range_queries)
Point (ciphers::elliptic_curve_key_exchange)
Point (geometry::grahamscan)
Point (geometry::jarvis)
Point
+
pattern (strings::boyer_moore)
perSegTree (range_queries)
Point (ciphers::elliptic_curve_key_exchange)
Point (geometry::grahamscan)
Point (geometry::jarvis)
Point
Q
-
query
queue
Queue
Queue_Array (data_structures::queue_using_array)
+
query
Queue
queue
Queue_Array (data_structures::queue_using_array)
R
RBtree
RootedTree (graph)
@@ -157,7 +162,7 @@ $(function(){initNavTree('classes.html',''); initResizable(); });
SegmentIntersection
SegmentTree (data_structures)
SG (range_queries::heavy_light_decomposition)
SkipList (data_structures)
Solution
Sparse_table (data_structures::sparse_table)
Stack (data_structures::stack_using_queue)
Stack (others::postfix_expression)
stack
stack_linkedList
stats_computer1 (statistics)
stats_computer2 (statistics)
T
-
TestCase
TestCases
Tnode (operations_on_datastructures::trie_operations)
tower
Treap (data_structures::treap)
Tree (range_queries::heavy_light_decomposition)
Tree234 (data_structures::tree_234)
trie (data_structures)
Trie (data_structures::trie_using_hashmap)
Trie
Trie::TrieNode
+
TestCase
TestCases
Tnode (operations_on_datastructures::trie_operations)
tower
Treap (data_structures::treap)
Tree (range_queries::heavy_light_decomposition)
Tree234 (data_structures::tree_234)
Trie (data_structures::trie_using_hashmap)
Trie
trie (data_structures)
Trie::TrieNode
U
uint128_t
uint256_t
@@ -170,7 +175,7 @@ $(function(){initNavTree('classes.html',''); initResizable(); }); diff --git a/d0/d01/smallest__circle_8cpp.html b/d0/d01/smallest__circle_8cpp.html index 7df31e0b3..766df13ca 100644 --- a/d0/d01/smallest__circle_8cpp.html +++ b/d0/d01/smallest__circle_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/smallest_circle.cpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -185,21 +190,21 @@ The function returns the radius of the circle and prints the coordinated of the
102 // viz., P[i], P[j] and P[k]
103 C.x = -0.5 * ((P[i].y * (P[j].x * P[j].x + P[j].y * P[j].y -
104 P[k].x * P[k].x - P[k].y * P[k].y) +
-
105 P[j].y * (P[k].x * P[k].x + P[k].y * P[k].y -
+
105 P[j].y * (P[k].x * P[k].x + P[k].y * P[k].y -
106 P[i].x * P[i].x - P[i].y * P[i].y) +
107 P[k].y * (P[i].x * P[i].x + P[i].y * P[i].y -
108 P[j].x * P[j].x - P[j].y * P[j].y)) /
109 (P[i].x * (P[j].y - P[k].y) +
-
110 P[j].x * (P[k].y - P[i].y) +
+
110 P[j].x * (P[k].y - P[i].y) +
111 P[k].x * (P[i].y - P[j].y)));
112 C.y = 0.5 * ((P[i].x * (P[j].x * P[j].x + P[j].y * P[j].y -
113 P[k].x * P[k].x - P[k].y * P[k].y) +
-
114 P[j].x * (P[k].x * P[k].x + P[k].y * P[k].y -
+
114 P[j].x * (P[k].x * P[k].x + P[k].y * P[k].y -
115 P[i].x * P[i].x - P[i].y * P[i].y) +
116 P[k].x * (P[i].x * P[i].x + P[i].y * P[i].y -
117 P[j].x * P[j].x - P[j].y * P[j].y)) /
118 (P[i].x * (P[j].y - P[k].y) +
-
119 P[j].x * (P[k].y - P[i].y) +
+
119 P[j].x * (P[k].y - P[i].y) +
120 P[k].x * (P[i].y - P[j].y)));
121 R = (LenghtLine(P[i], P[j]) * LenghtLine(P[j], P[k]) *
122 LenghtLine(P[k], P[i])) /
@@ -258,7 +263,7 @@ Here is the call graph for this function:
double LenghtLine ( - const Point & A, + const Point & A, @@ -301,7 +306,7 @@ Here is the call graph for this function: int main ( - void ) + void ) @@ -321,7 +326,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -335,12 +340,12 @@ Here is the call graph for this function: bool PointInCircle ( - const std::vector< Point > & P, + const std::vector< Point > & P, - const Point & Center, + const Point & Center, @@ -384,7 +389,7 @@ Here is the call graph for this function: void test ( - ) + ) @@ -422,7 +427,7 @@ Here is the call graph for this function: void test2 ( - ) + ) @@ -456,7 +461,7 @@ Here is the call graph for this function: void test3 ( - ) + ) @@ -490,12 +495,12 @@ Here is the call graph for this function: double TriangleArea ( - const Point & A, + const Point & A, - const Point & B, + const Point & B, @@ -537,7 +542,7 @@ Here is the call graph for this function: diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map index 631dcbf6a..5e0d145f7 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -2,7 +2,7 @@ - + diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index 011bc8759..f7d45aa95 100644 --- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -1,12 +1,13 @@ - + - + main @@ -31,9 +32,9 @@ Node2 - -data_structures::SkipList -::displayList + +data_structures::SkipList +::displayList @@ -41,8 +42,8 @@ Node1->Node2 - - + + @@ -50,9 +51,9 @@ Node4 - -data_structures::SkipList -::insertElement + +data_structures::SkipList +::insertElement @@ -60,53 +61,35 @@ Node1->Node4 - - + + - - -Node7 - + + +Node8 + std::rand - - -Node1->Node7 - + + +Node1->Node8 + - - -Node9 - - -std::srand - - - - - -Node1->Node9 - - - - - - Node10 - - -std::time + + +std::srand @@ -114,6 +97,24 @@ Node1->Node10 + + + + + + + +Node11 + + +std::time + + + + + +Node1->Node11 + @@ -123,8 +124,8 @@ Node3 - -std::endl + +std::endl @@ -132,8 +133,8 @@ Node2->Node3 - - + + @@ -141,8 +142,8 @@ Node4->Node3 - - + + @@ -150,8 +151,8 @@ Node5 - -std::array::fill + +std::array::fill @@ -159,18 +160,17 @@ Node4->Node5 - - + + Node6 - - -data_structures::SkipList -::randomLevel + + +std::make_shared @@ -178,42 +178,61 @@ Node4->Node6 - - + + - - -Node8 - + + +Node7 + + +data_structures::SkipList +::randomLevel + + + + + +Node4->Node7 + + + + + + + + +Node9 + update - - -Node4->Node8 - - - + + +Node4->Node9 + + + - - -Node6->Node7 - + + +Node7->Node8 + - - -Node8->Node8 - + + +Node9->Node9 + diff --git a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 5bc05f4ef..b61d041ac 100644 --- a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,12 +1,12 @@ - - - + + main @@ -21,9 +21,9 @@ Node2 - -data_structures::SkipList -::displayList + +data_structures::SkipList +::displayList @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,9 +40,9 @@ Node4 - -data_structures::SkipList -::insertElement + +data_structures::SkipList +::insertElement @@ -50,53 +50,35 @@ Node1->Node4 - - + + - - -Node7 - + + +Node8 + std::rand - - -Node1->Node7 - + + +Node1->Node8 + - - -Node9 - - -std::srand - - - - - -Node1->Node9 - - - - - - Node10 - - -std::time + + +std::srand @@ -104,6 +86,24 @@ Node1->Node10 + + + + + + + +Node11 + + +std::time + + + + + +Node1->Node11 + @@ -113,8 +113,8 @@ Node3 - -std::endl + +std::endl @@ -122,8 +122,8 @@ Node2->Node3 - - + + @@ -131,8 +131,8 @@ Node4->Node3 - - + + @@ -140,8 +140,8 @@ Node5 - -std::array::fill + +std::array::fill @@ -149,18 +149,17 @@ Node4->Node5 - - + + Node6 - - -data_structures::SkipList -::randomLevel + + +std::make_shared @@ -168,42 +167,61 @@ Node4->Node6 - - + + - - -Node8 - + + +Node7 + + +data_structures::SkipList +::randomLevel + + + + + +Node4->Node7 + + + + + + + + +Node9 + update - - -Node4->Node8 - - - + + +Node4->Node9 + + + - - -Node6->Node7 - + + +Node7->Node8 + - - -Node8->Node8 - + + +Node9->Node9 + diff --git a/d0/d5b/windowed__median_8cpp__incl.map b/d0/d5b/windowed__median_8cpp__incl.map index 72147224c..a4b88f071 100644 --- a/d0/d5b/windowed__median_8cpp__incl.map +++ b/d0/d5b/windowed__median_8cpp__incl.map @@ -2,13 +2,13 @@ - + - + diff --git a/d0/d5b/windowed__median_8cpp__incl.svg b/d0/d5b/windowed__median_8cpp__incl.svg index ef183f02c..d22f051e3 100644 --- a/d0/d5b/windowed__median_8cpp__incl.svg +++ b/d0/d5b/windowed__median_8cpp__incl.svg @@ -1,13 +1,14 @@ - - + + + + + +strings::boyer_moore::init_pattern + + +Node1 + + +strings::boyer_moore +::init_pattern + + + + + +Node2 + + +strings::boyer_moore +::init_bad_char + + + + + +Node1->Node2 + + + + + + + + +Node5 + + +strings::boyer_moore +::init_good_suffix + + + + + +Node1->Node5 + + + + + + + + +Node3 + + +std::string::length + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::vector::resize + + + + + +Node2->Node4 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node4 + + + + + + + + + + + + + diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg new file mode 100644 index 000000000..94680140d --- /dev/null +++ b/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg @@ -0,0 +1,123 @@ + + + + + + +strings::boyer_moore::init_pattern + + +Node1 + + +strings::boyer_moore +::init_pattern + + + + + +Node2 + + +strings::boyer_moore +::init_bad_char + + + + + +Node1->Node2 + + + + + + + + +Node5 + + +strings::boyer_moore +::init_good_suffix + + + + + +Node1->Node5 + + + + + + + + +Node3 + + +std::string::length + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::vector::resize + + + + + +Node2->Node4 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node3 + + + + + + + + +Node5->Node4 + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.map b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.map similarity index 100% rename from d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.map rename to d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.map diff --git a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.md5 b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.md5 similarity index 100% rename from d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.md5 rename to d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.md5 diff --git a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg similarity index 97% rename from d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.svg rename to d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg index 9874fd006..10bf363f6 100644 --- a/d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.svg +++ b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + strings::boyer_moore::init_bad_char @@ -28,15 +29,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -47,9 +39,9 @@ - + Node1->Node2 - + @@ -65,9 +57,9 @@ - + Node1->Node3 - + diff --git a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg similarity index 74% rename from d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg rename to d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg index c129abbc8..3eb017cfc 100644 --- a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg +++ b/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg @@ -1,12 +1,12 @@ - - - + + strings::boyer_moore::init_bad_char @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -37,9 +28,9 @@ - + Node1->Node2 - + @@ -55,9 +46,9 @@ - + Node1->Node3 - + diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map new file mode 100644 index 000000000..5a0d69f51 --- /dev/null +++ b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 new file mode 100644 index 000000000..b0018e7a8 --- /dev/null +++ b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 @@ -0,0 +1 @@ +bb4541f9b08a8fc985c38a6e1af4e126 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg similarity index 77% rename from d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg rename to d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg index a22384af2..d32f8af99 100644 --- a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg +++ b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + strings::boyer_moore::init_good_suffix @@ -28,15 +29,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -47,18 +39,18 @@ - + Node1->Node2 - + - + Node1->Node2 - + @@ -74,9 +66,9 @@ - + Node1->Node3 - + diff --git a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg similarity index 74% rename from d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg rename to d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg index 39bec75b6..40f8bcebd 100644 --- a/d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg +++ b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg @@ -1,12 +1,12 @@ - - - + + strings::boyer_moore::init_good_suffix @@ -18,15 +18,6 @@ - - -Node1->Node1 - - - - - - Node2 @@ -37,18 +28,18 @@ - + Node1->Node2 - + - + Node1->Node2 - + @@ -64,9 +55,9 @@ - + Node1->Node3 - + diff --git a/d0/dc4/struct_point-members.html b/d0/dc4/struct_point-members.html index 1a7283c10..967b36811 100644 --- a/d0/dc4/struct_point-members.html +++ b/d0/dc4/struct_point-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({ - + +
@@ -115,7 +120,7 @@ $(function(){initNavTree('d8/dc8/struct_point.html','../../'); initResizable(); diff --git a/d0/dc8/intersection__of__two__arrays_8cpp__incl.map b/d0/dc8/intersection__of__two__arrays_8cpp__incl.map index 180713aba..4b19a513e 100644 --- a/d0/dc8/intersection__of__two__arrays_8cpp__incl.map +++ b/d0/dc8/intersection__of__two__arrays_8cpp__incl.map @@ -6,6 +6,6 @@ - + diff --git a/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg b/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg index e16eacbaf..afe02460d 100644 --- a/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg +++ b/d0/dc8/intersection__of__two__arrays_8cpp__incl.svg @@ -1,13 +1,14 @@ - - + + + + + +data_structures::linked_list::list::push_front + + +Node1 + + +data_structures::linked +_list::list::push_front + + + + + +Node2 + + +data_structures::linked +_list::list::isEmpty + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::make_shared + + + + + +Node1->Node3 + + + + + + + + + + + + + diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph_org.svg new file mode 100644 index 000000000..495c7572a --- /dev/null +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph_org.svg @@ -0,0 +1,59 @@ + + + + + + +data_structures::linked_list::list::push_front + + +Node1 + + +data_structures::linked +_list::list::push_front + + + + + +Node2 + + +data_structures::linked +_list::list::isEmpty + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::make_shared + + + + + +Node1->Node3 + + + + + + + + diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.md5 deleted file mode 100644 index 078c7238e..000000000 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -dde7b8bd9532129f5887f29924a23a09 \ No newline at end of file diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.map new file mode 100644 index 000000000..5b2b3d934 --- /dev/null +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.md5 new file mode 100644 index 000000000..a9e619480 --- /dev/null +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.md5 @@ -0,0 +1 @@ +eb039a1cbb1453f6e0da4806c497b8f2 \ No newline at end of file diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg similarity index 59% rename from d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.svg rename to d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg index e7824b13d..578936117 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_ad585670a392c7e842c992d088093dff5_cgraph.svg +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg @@ -1,13 +1,14 @@ - - - + + + + - + + + +data_structures::linked_list::list::push_back + + +Node1 + + +data_structures::linked +_list::list::push_back + + + + + +Node2 + + +data_structures::linked +_list::list::isEmpty + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::make_shared + + + + + +Node1->Node3 + + + + + + + + + + + + + diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph_org.svg new file mode 100644 index 000000000..b583f02f3 --- /dev/null +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph_org.svg @@ -0,0 +1,59 @@ + + + + + + +data_structures::linked_list::list::push_back + + +Node1 + + +data_structures::linked +_list::list::push_back + + + + + +Node2 + + +data_structures::linked +_list::list::isEmpty + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::make_shared + + + + + +Node1->Node3 + + + + + + + + diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.md5 deleted file mode 100644 index 7a0d91ab8..000000000 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -01dcee7f6f1db9039719a671ed45682e \ No newline at end of file diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.map similarity index 78% rename from d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.map rename to d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.map index 4f1f6fa59..435b604e7 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.map +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.map @@ -1,5 +1,5 @@ - + diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.md5 new file mode 100644 index 000000000..4fafb0812 --- /dev/null +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.md5 @@ -0,0 +1 @@ +001150031427d341e6f62059c5eb7640 \ No newline at end of file diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg similarity index 91% rename from d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.svg rename to d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg index b80e30143..f53643680 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a89ad00dbd262e2527129813b53e16f81_cgraph.svg +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg @@ -1,13 +1,14 @@ - - + + - - - -data_structures::linked_list::list::push_front - - -Node1 - - -data_structures::linked -_list::list::push_front - - - - - -Node2 - - -data_structures::linked -_list::list::isEmpty - - - - - -Node1->Node2 - - - - - - - - - - - - - diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph_org.svg deleted file mode 100644 index e954d9c7b..000000000 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a9c73f393e984f93f33852334d1a04be0_cgraph_org.svg +++ /dev/null @@ -1,41 +0,0 @@ - - - - - - -data_structures::linked_list::list::push_front - - -Node1 - - -data_structures::linked -_list::list::push_front - - - - - -Node2 - - -data_structures::linked -_list::list::isEmpty - - - - - -Node1->Node2 - - - - - - - - diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.map similarity index 78% rename from d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.map rename to d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.map index 030745691..acbe5059f 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.map +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.map @@ -1,7 +1,7 @@ - + - + diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5 new file mode 100644 index 000000000..d596dd346 --- /dev/null +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5 @@ -0,0 +1 @@ +7f4463b596974a51ddfeefc35461a1c4 \ No newline at end of file diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg similarity index 93% rename from d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.svg rename to d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg index 40eb6c030..1017a0680 100644 --- a/d1/def/classdata__structures_1_1linked__list_1_1list_a4649fc2c5d09dc58608cd9299db9946f_cgraph.svg +++ b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg @@ -1,13 +1,14 @@ - - + + + + + +greedy_algorithms::dijkstra::dijkstra + + +Node1 + + +greedy_algorithms:: +dijkstra::dijkstra + + + + + +Node2 + + +greedy_algorithms:: +dijkstra::minimum_distance + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +greedy_algorithms:: +dijkstra::print + + + + + +Node1->Node3 + + + + + + + + + + + + + diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg new file mode 100644 index 000000000..f0e744bb8 --- /dev/null +++ b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg @@ -0,0 +1,60 @@ + + + + + + +greedy_algorithms::dijkstra::dijkstra + + +Node1 + + +greedy_algorithms:: +dijkstra::dijkstra + + + + + +Node2 + + +greedy_algorithms:: +dijkstra::minimum_distance + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +greedy_algorithms:: +dijkstra::print + + + + + +Node1->Node3 + + + + + + + + diff --git a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html index 0175d227d..f32c212df 100644 --- a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html +++ b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -112,7 +117,7 @@ $(function(){initNavTree('d9/d5a/structgeometry_1_1jarvis_1_1_point.html','../.. diff --git a/d2/d38/pancake__sort_8cpp__incl.map b/d2/d38/pancake__sort_8cpp__incl.map index 935f216e3..2931359ac 100644 --- a/d2/d38/pancake__sort_8cpp__incl.map +++ b/d2/d38/pancake__sort_8cpp__incl.map @@ -6,6 +6,6 @@ - + diff --git a/d2/d38/pancake__sort_8cpp__incl.svg b/d2/d38/pancake__sort_8cpp__incl.svg index 98b487c54..c8753795a 100644 --- a/d2/d38/pancake__sort_8cpp__incl.svg +++ b/d2/d38/pancake__sort_8cpp__incl.svg @@ -1,13 +1,14 @@ - - + + + + + +data_structures::trie_using_hashmap::Trie::insert + + +Node1 + + +data_structures::trie +_using_hashmap::Trie +::insert + + + + + +Node2 + + +std::make_shared + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph_org.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph_org.svg new file mode 100644 index 000000000..843378f63 --- /dev/null +++ b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph_org.svg @@ -0,0 +1,41 @@ + + + + + + +data_structures::trie_using_hashmap::Trie::insert + + +Node1 + + +data_structures::trie +_using_hashmap::Trie +::insert + + + + + +Node2 + + +std::make_shared + + + + + +Node1->Node2 + + + + + + + + diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map index 389645e68..7cfe396ce 100644 --- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map +++ b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map @@ -2,7 +2,7 @@ - + diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg index d7e25a6cf..4b3939011 100644 --- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg +++ b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg @@ -1,13 +1,14 @@ - - + + - - - -strings::boyer_moore::is_prefix - - -Node1 - - -strings::boyer_moore -::is_prefix - - - - - -Node1->Node1 - - - - - - - - - - - - - diff --git a/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph_org.svg deleted file mode 100644 index 48572705e..000000000 --- a/d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph_org.svg +++ /dev/null @@ -1,31 +0,0 @@ - - - - - - -strings::boyer_moore::is_prefix - - -Node1 - - -strings::boyer_moore -::is_prefix - - - - - -Node1->Node1 - - - - - - - - diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.map b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.map deleted file mode 100644 index 58d1d090c..000000000 --- a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.map +++ /dev/null @@ -1,17 +0,0 @@ - - - - - - - - - - - - - - - - - diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.md5 deleted file mode 100644 index 48be5f8c0..000000000 --- a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -304c1d6bc9e25fd666861b19017f9ea7 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.svg b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.svg deleted file mode 100644 index 1cb630de1..000000000 --- a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.svg +++ /dev/null @@ -1,175 +0,0 @@ - - - - - - - - - - - -strings::boyer_moore::init_pattern - - -Node1 - - -strings::boyer_moore -::init_pattern - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -strings::boyer_moore -::init_bad_char - - - - - -Node1->Node2 - - - - - - - - -Node5 - - -strings::boyer_moore -::init_good_suffix - - - - - -Node1->Node5 - - - - - - - - -Node2->Node2 - - - - - - - - -Node3 - - -std::string::length - - - - - -Node2->Node3 - - - - - - - - -Node4 - - -std::vector::resize - - - - - -Node2->Node4 - - - - - - - - -Node5->Node3 - - - - - - - - -Node5->Node3 - - - - - - - - -Node5->Node4 - - - - - - - - -Node5->Node5 - - - - - - - - - - - - - diff --git a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg deleted file mode 100644 index ade65f177..000000000 --- a/d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg +++ /dev/null @@ -1,150 +0,0 @@ - - - - - - -strings::boyer_moore::init_pattern - - -Node1 - - -strings::boyer_moore -::init_pattern - - - - - -Node1->Node1 - - - - - - - - -Node2 - - -strings::boyer_moore -::init_bad_char - - - - - -Node1->Node2 - - - - - - - - -Node5 - - -strings::boyer_moore -::init_good_suffix - - - - - -Node1->Node5 - - - - - - - - -Node2->Node2 - - - - - - - - -Node3 - - -std::string::length - - - - - -Node2->Node3 - - - - - - - - -Node4 - - -std::vector::resize - - - - - -Node2->Node4 - - - - - - - - -Node5->Node3 - - - - - - - - -Node5->Node3 - - - - - - - - -Node5->Node4 - - - - - - - - -Node5->Node5 - - - - - - - - diff --git a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map deleted file mode 100644 index df70edffd..000000000 --- a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map +++ /dev/null @@ -1,8 +0,0 @@ - - - - - - - - diff --git a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 deleted file mode 100644 index 6c3ea024d..000000000 --- a/d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -2974149438887cb82d1c50b12d09ffa5 \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map index d6807f12e..cb5cf3fd0 100644 --- a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map +++ b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map @@ -1,10 +1,36 @@ - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 index 824c933e3..568a3a749 100644 --- a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 +++ b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 @@ -1 +1 @@ -1d1e002573401f45a6341389936a84c1 \ No newline at end of file +4eb1653c59591f0ecd44126f66bf895d \ No newline at end of file diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg index 7e6af1b78..0e9806ade 100644 --- a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg +++ b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg @@ -1,29 +1,66 @@ - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - + tests Node1 - -tests + +tests @@ -31,8 +68,8 @@ Node2 - -and_test + +and_test @@ -40,35 +77,36 @@ Node1->Node2 - - + + - - -Node4 - - -pat_test + + +Node13 + + +pat_test - - -Node1->Node4 - - - + + +Node1->Node13 + + + Node3 - - -std::vector::size + + +strings::boyer_moore +::init_pattern @@ -76,22 +114,281 @@ Node2->Node3 - - + + - - -Node4->Node3 - - - + + +Node8 + + +strings::boyer_moore +::is_prefix + + + + + +Node2->Node8 + + + + + + + + +Node9 + + +strings::boyer_moore +::search + + + + + +Node2->Node9 + + + + + + + + +Node12 + + +std::vector::size + + + + + +Node2->Node12 + + + + + + + + +Node4 + + +strings::boyer_moore +::init_bad_char + + + + + +Node3->Node4 + + + + + + + + +Node7 + + +strings::boyer_moore +::init_good_suffix + + + + + +Node3->Node7 + + + + + + + + +Node5 + + +std::string::length + + + + + +Node4->Node5 + + + + + + + + +Node6 + + +std::vector::resize + + + + + +Node4->Node6 + + + + + + + + +Node7->Node5 + + + + + + + + +Node7->Node5 + + + + + + + + +Node7->Node6 + + + + + + + + +Node9->Node5 + + + + + + + + +Node9->Node5 + + + + + + + + +Node10 + + +std::max + + + + + +Node9->Node10 + + + + + + + + +Node11 + + +std::vector::push_back + + + + + +Node9->Node11 + + + + + + + + +Node13->Node3 + + + + + + + + +Node13->Node8 + + + + + + + + +Node13->Node9 + + + + + + + + +Node13->Node12 + + + + + + + + + + + + + + + + + + + + + - + Algorithms_in_C++: others/lru_cache.cpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -127,10 +132,10 @@ Classes - + - +

Namespaces

namespace  others
namespace  others
 for vector
 
namespace  lru_cache
namespace  lru_cache
 Implementation of the LRU caching algorithm
 
@@ -237,7 +242,7 @@ Here is the call graph for this function: - +
int main (void )void )
@@ -285,7 +290,7 @@ Here is the call graph for this function:
static void lru_tests::run_tests ( - ) + ) @@ -329,7 +334,7 @@ Here is the call graph for this function: static void lru_tests::test_1 ( - ) + ) @@ -382,7 +387,7 @@ Here is the call graph for this function: static void lru_tests::test_2 ( - ) + ) @@ -435,7 +440,7 @@ Here is the call graph for this function: static void lru_tests::test_3 ( - ) + ) @@ -482,7 +487,7 @@ Here is the call graph for this function: diff --git a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map index 7107ac6f9..cf9f79432 100644 --- a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map +++ b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map @@ -1,28 +1,28 @@ - - - - - - - - - - + + + + + + + + + + - + - - - - - - - - - + + + + + + + + + - - - + + + diff --git a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5 b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5 index 6a8f2412c..fb46817ca 100644 --- a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5 +++ b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5 @@ -1 +1 @@ -eb15a44a0d043cdd07e22bcd260c4c10 \ No newline at end of file +45c667bda31cfb5b173793e831e0ddde \ No newline at end of file diff --git a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg index e1df1d258..f03c00ef9 100644 --- a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg +++ b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + test @@ -68,9 +69,9 @@ Node3 - -geometry::jarvis::Convexhull -::orientation + +geometry::jarvis::Convexhull +::orientation @@ -78,8 +79,8 @@ Node2->Node3 - - + + @@ -87,8 +88,8 @@ Node4 - -std::vector::push_back + +std::vector::push_back @@ -96,8 +97,8 @@ Node2->Node4 - - + + diff --git a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index b1e674892..4a7055069 100644 --- a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,12 +1,12 @@ - - - + + test @@ -58,9 +58,9 @@ Node3 - -geometry::jarvis::Convexhull -::orientation + +geometry::jarvis::Convexhull +::orientation @@ -68,8 +68,8 @@ Node2->Node3 - - + + @@ -77,8 +77,8 @@ Node4 - -std::vector::push_back + +std::vector::push_back @@ -86,8 +86,8 @@ Node2->Node4 - - + + diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index e2d91f417..98e6afae9 100644 --- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,13 +1,13 @@ - - - - - - - + + + + + + + - + - + diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 093dab74f..f064e6914 100644 --- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + main @@ -86,9 +87,9 @@ Node4 - -geometry::jarvis::Convexhull -::orientation + +geometry::jarvis::Convexhull +::orientation @@ -96,8 +97,8 @@ Node3->Node4 - - + + @@ -105,8 +106,8 @@ Node5 - -std::vector::push_back + +std::vector::push_back @@ -114,8 +115,8 @@ Node3->Node5 - - + + diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 4d3f70a3f..0bf11d8ed 100644 --- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,12 +1,12 @@ - - - + + main @@ -76,9 +76,9 @@ Node4 - -geometry::jarvis::Convexhull -::orientation + +geometry::jarvis::Convexhull +::orientation @@ -86,8 +86,8 @@ Node3->Node4 - - + + @@ -95,8 +95,8 @@ Node5 - -std::vector::push_back + +std::vector::push_back @@ -104,8 +104,8 @@ Node3->Node5 - - + + diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html index fe8e041ab..2008cd28b 100644 --- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html +++ b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: bit_manipulation/travelling_salesman_using_bit_manipulation.cpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({ - + +
@@ -121,10 +126,10 @@ Include dependency graph for travelling_salesman_using_bit_manipulation.cpp: - + - +

Namespaces

namespace  bit_manipulation
namespace  bit_manipulation
 for IO operations
 
namespace  travellingSalesman_bitmanipulation
namespace  travellingSalesman_bitmanipulation
 Functions for the Travelling Salesman Bitmask implementation.
 
@@ -156,7 +161,7 @@ Functions - +
int main (void )void )
@@ -189,7 +194,7 @@ Here is the call graph for this function:
static void test ( - ) + ) @@ -258,22 +263,22 @@ Here is the call graph for this function: std::uint64_t bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation ( - std::vector< std::vector< uint32_t > > dist, + std::vector< std::vector< uint32_t > > dist, - std::uint64_t setOfCities, + std::uint64_t setOfCities, - std::uint64_t city, + std::uint64_t city, - std::uint64_t n, + std::uint64_t n, @@ -339,7 +344,7 @@ Here is the call graph for this function: diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 9b00b19d9..02785897e 100644 --- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + data_structures::SkipList::insertElement Node1 - -data_structures::SkipList -::insertElement + +data_structures::SkipList +::insertElement @@ -32,8 +33,8 @@ Node2 - -std::endl + +std::endl @@ -41,8 +42,8 @@ Node1->Node2 - - + + @@ -50,8 +51,8 @@ Node3 - -std::array::fill + +std::array::fill @@ -59,18 +60,17 @@ Node1->Node3 - - + + Node4 - - -data_structures::SkipList -::randomLevel + + +std::make_shared @@ -78,51 +78,70 @@ Node1->Node4 - - - - - - - -Node6 - - -update - - - - - -Node1->Node6 - - - + + Node5 - + + +data_structures::SkipList +::randomLevel + + + + + +Node1->Node5 + + + + + + + + +Node7 + + +update + + + + + +Node1->Node7 + + + + + + + + +Node6 + std::rand - - -Node4->Node5 - + + +Node5->Node6 + - - -Node6->Node6 - + + +Node7->Node7 + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg index 5e789c96d..6076aff0d 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg @@ -1,20 +1,20 @@ - - - + + data_structures::SkipList::insertElement Node1 - -data_structures::SkipList -::insertElement + +data_structures::SkipList +::insertElement @@ -22,8 +22,8 @@ Node2 - -std::endl + +std::endl @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -std::array::fill + +std::array::fill @@ -49,18 +49,17 @@ Node1->Node3 - - + + Node4 - - -data_structures::SkipList -::randomLevel + + +std::make_shared @@ -68,51 +67,70 @@ Node1->Node4 - - - - - - - -Node6 - - -update - - - - - -Node1->Node6 - - - + + Node5 - + + +data_structures::SkipList +::randomLevel + + + + + +Node1->Node5 + + + + + + + + +Node7 + + +update + + + + + +Node1->Node7 + + + + + + + + +Node6 + std::rand - - -Node4->Node5 - + + +Node5->Node6 + - - -Node6->Node6 - + + +Node7->Node7 + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map new file mode 100644 index 000000000..82f00c5c8 --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5 new file mode 100644 index 000000000..a1c0e17fd --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5 @@ -0,0 +1 @@ +c11614557089243886366727115b2ec0 \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_ae197eb50188fb761346952b9b5f6be59_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg similarity index 52% rename from d8/dee/avltree_8cpp_ae197eb50188fb761346952b9b5f6be59_cgraph.svg rename to d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg index e20e5146c..edde3df9b 100644 --- a/d8/dee/avltree_8cpp_ae197eb50188fb761346952b9b5f6be59_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg @@ -1,13 +1,14 @@ - - - + + + + - - -levelOrder + +data_structures::SkipList::SkipList Node1 - - -levelOrder + + +data_structures::SkipList +::SkipList Node2 - - -std::vector::data + + +std::make_shared @@ -40,8 +42,8 @@ Node1->Node2 - - + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg new file mode 100644 index 000000000..b11633ead --- /dev/null +++ b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg @@ -0,0 +1,40 @@ + + + + + + +data_structures::SkipList::SkipList + + +Node1 + + +data_structures::SkipList +::SkipList + + + + + +Node2 + + +std::make_shared + + + + + +Node1->Node2 + + + + + + + + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map index 532d40cf0..ddd608fc1 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map +++ b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map @@ -1,5 +1,5 @@ - + diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg index d71fb6b07..14f3b96b6 100644 --- a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg +++ b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + test @@ -31,10 +32,10 @@ Node2 - -data_structures::trie -_using_hashmap::Trie -::delete_word + +data_structures::trie +_using_hashmap::Trie +::delete_word @@ -42,8 +43,8 @@ Node1->Node2 - - + + @@ -85,10 +86,10 @@ - - -Node10 - + + +Node11 + data_structures::trie _using_hashmap::Trie @@ -96,19 +97,19 @@ - - -Node1->Node10 - + + +Node1->Node11 + - - -Node13 - + + +Node14 + data_structures::trie _using_hashmap::Trie @@ -116,41 +117,21 @@ - - -Node1->Node13 - - - - - - - - -Node14 - - -std::vector::size - - - Node1->Node14 - - + + Node15 - - -data_structures::trie -_using_hashmap::Trie -::startwith + + +std::vector::size @@ -158,6 +139,26 @@ Node1->Node15 + + + + + + + +Node16 + + +data_structures::trie +_using_hashmap::Trie +::startwith + + + + + +Node1->Node16 + @@ -167,8 +168,8 @@ Node3 - -std::string::back + +std::string::back @@ -176,8 +177,8 @@ Node2->Node3 - - + + @@ -185,8 +186,8 @@ Node4 - -std::stack::pop + +std::stack::pop @@ -194,8 +195,8 @@ Node2->Node4 - - + + @@ -203,8 +204,8 @@ Node5 - -std::string::pop_back + +std::string::pop_back @@ -212,8 +213,8 @@ Node2->Node5 - - + + @@ -221,8 +222,8 @@ Node6 - -std::stack::push + +std::stack::push @@ -230,8 +231,8 @@ Node2->Node6 - - + + @@ -239,8 +240,8 @@ Node7 - -std::stack::top + +std::stack::top @@ -248,64 +249,82 @@ Node2->Node7 - - + + - - -Node11 - - -data_structures::trie -_using_hashmap::Trie -::get_all_words + + +Node10 + + +std::make_shared - - -Node10->Node11 - - - - - - - - -Node11->Node5 - - - - - - - - -Node11->Node11 - - - + + +Node9->Node10 + + + Node12 - - -std::vector::push_back + + +data_structures::trie +_using_hashmap::Trie +::get_all_words - + Node11->Node12 - - - + + + + + + + + +Node12->Node5 + + + + + + + + +Node12->Node12 + + + + + + + + +Node13 + + +std::vector::push_back + + + + + +Node12->Node13 + + + diff --git a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index b3321a841..965c66f72 100644 --- a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,12 +1,12 @@ - - - + + test @@ -21,10 +21,10 @@ Node2 - -data_structures::trie -_using_hashmap::Trie -::delete_word + +data_structures::trie +_using_hashmap::Trie +::delete_word @@ -32,8 +32,8 @@ Node1->Node2 - - + + @@ -75,10 +75,10 @@ - - -Node10 - + + +Node11 + data_structures::trie _using_hashmap::Trie @@ -86,19 +86,19 @@ - - -Node1->Node10 - + + +Node1->Node11 + - - -Node13 - + + +Node14 + data_structures::trie _using_hashmap::Trie @@ -106,41 +106,21 @@ - - -Node1->Node13 - - - - - - - - -Node14 - - -std::vector::size - - - Node1->Node14 - - + + Node15 - - -data_structures::trie -_using_hashmap::Trie -::startwith + + +std::vector::size @@ -148,6 +128,26 @@ Node1->Node15 + + + + + + + +Node16 + + +data_structures::trie +_using_hashmap::Trie +::startwith + + + + + +Node1->Node16 + @@ -157,8 +157,8 @@ Node3 - -std::string::back + +std::string::back @@ -166,8 +166,8 @@ Node2->Node3 - - + + @@ -175,8 +175,8 @@ Node4 - -std::stack::pop + +std::stack::pop @@ -184,8 +184,8 @@ Node2->Node4 - - + + @@ -193,8 +193,8 @@ Node5 - -std::string::pop_back + +std::string::pop_back @@ -202,8 +202,8 @@ Node2->Node5 - - + + @@ -211,8 +211,8 @@ Node6 - -std::stack::push + +std::stack::push @@ -220,8 +220,8 @@ Node2->Node6 - - + + @@ -229,8 +229,8 @@ Node7 - -std::stack::top + +std::stack::top @@ -238,64 +238,82 @@ Node2->Node7 - - + + - - -Node11 - - -data_structures::trie -_using_hashmap::Trie -::get_all_words + + +Node10 + + +std::make_shared - - -Node10->Node11 - - - - - - - - -Node11->Node5 - - - - - - - - -Node11->Node11 - - - + + +Node9->Node10 + + + Node12 - - -std::vector::push_back + + +data_structures::trie +_using_hashmap::Trie +::get_all_words - + Node11->Node12 - - - + + + + + + + + +Node12->Node5 + + + + + + + + +Node12->Node12 + + + + + + + + +Node13 + + +std::vector::push_back + + + + + +Node12->Node13 + + + diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 25158d339..08af2e599 100644 --- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,35 +1,37 @@ - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + - + - - - + + + - + - - - - - - - + + + + + + + + + diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index cf2611401..f8f44eb7c 100644 --- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -0ca9b6b8918e3e892121e05dc99af7b2 \ No newline at end of file +844bc27b3f11120f54de131666dd007f \ No newline at end of file diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index bfd1e8fbc..55cc99d82 100644 --- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,12 +1,13 @@ - - + + - + ciphers::HillCipher::rand_range Node1 - -ciphers::HillCipher -::rand_range + +ciphers::HillCipher +::rand_range @@ -32,8 +33,8 @@ Node2 - -determinant_lu + +determinant_lu @@ -41,8 +42,27 @@ Node1->Node2 - - + + + + + + + +Node5 + + +ciphers::HillCipher +::rand_range + + + + + +Node1->Node5 + + + @@ -50,8 +70,8 @@ Node3 - -lu_decomposition + +lu_decomposition @@ -59,8 +79,8 @@ Node2->Node3 - - + + @@ -68,8 +88,8 @@ Node4 - -std::vector::size + +std::vector::size @@ -77,8 +97,8 @@ Node2->Node4 - - + + @@ -86,8 +106,26 @@ Node3->Node4 - - + + + + + + + +Node6 + + +std::rand + + + + + +Node5->Node6 + + + diff --git a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg index 523cb0976..ddc66b24d 100644 --- a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg +++ b/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg @@ -1,20 +1,20 @@ - - - + + ciphers::HillCipher::rand_range Node1 - -ciphers::HillCipher -::rand_range + +ciphers::HillCipher +::rand_range @@ -22,8 +22,8 @@ Node2 - -determinant_lu + +determinant_lu @@ -31,8 +31,27 @@ Node1->Node2 - - + + + + + + + +Node5 + + +ciphers::HillCipher +::rand_range + + + + + +Node1->Node5 + + + @@ -40,8 +59,8 @@ Node3 - -lu_decomposition + +lu_decomposition @@ -49,8 +68,8 @@ Node2->Node3 - - + + @@ -58,8 +77,8 @@ Node4 - -std::vector::size + +std::vector::size @@ -67,8 +86,8 @@ Node2->Node4 - - + + @@ -76,8 +95,26 @@ Node3->Node4 - - + + + + + + + +Node6 + + +std::rand + + + + + +Node5->Node6 + + + diff --git a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg index 9cab7e0a2..71a81aa80 100644 --- a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg +++ b/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + main Node1 - -main + +main @@ -31,8 +32,8 @@ Node2 - -std::srand + +std::srand @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -49,8 +50,8 @@ Node3 - -std::strlen + +std::strlen @@ -58,8 +59,8 @@ Node1->Node3 - - + + @@ -67,8 +68,8 @@ Node4 - -test1 + +test1 @@ -76,53 +77,53 @@ Node1->Node4 - - + + + + + + + +Node15 + + +test2 + + + + + +Node1->Node15 + + + Node16 - - -test2 + + +std::time - + Node1->Node16 - - - - - - - - -Node17 - - -std::time - - - - - -Node1->Node17 - - - + + + Node5 - - -std::vector::at + + +dsu::get @@ -130,53 +131,89 @@ Node4->Node5 - - + + + + + + + +Node10 + + +dsu::UnionSet + + + + + +Node4->Node10 + + + Node6 - - -dsu::get + + +dsu::get_max - - -Node4->Node6 - - - + + +Node5->Node6 + + + - - -Node11 - - -dsu::UnionSet + + +Node8 + + +dsu::get_min - - -Node4->Node11 - - - + + +Node5->Node8 + + + + + + + + +Node9 + + +dsu::size + + + + + +Node5->Node9 + + + Node7 - - -dsu::get_max + + +dsu::findSet @@ -184,206 +221,143 @@ Node6->Node7 - - - - - - - -Node9 - - -dsu::get_min - - - - - -Node6->Node9 - - - - - - - - -Node10 - - -dsu::size - - - - - -Node6->Node10 - - - - - - - - -Node8 - - -dsu::findSet - - - - - -Node7->Node8 - - - -Node8->Node8 - + + +Node7->Node7 + - - -Node9->Node8 - + + +Node8->Node7 + - - -Node10->Node8 - + + +Node9->Node7 + - - -Node11->Node8 - + + +Node10->Node7 + + + +Node11 + + +dsu::isSame + + + + + +Node10->Node11 + + + + + + Node12 - - -dsu::isSame + + +std::max - - -Node11->Node12 - - - + + +Node10->Node12 + + + Node13 - - -std::max + + +std::min - - -Node11->Node13 - - - + + +Node10->Node13 + + + Node14 - - -std::min - - - - - -Node11->Node14 - - - - - - - - -Node15 - + std::swap - - -Node11->Node15 - + + +Node10->Node14 + - - -Node12->Node8 - + + +Node11->Node7 + - - -Node16->Node5 - - - + + +Node15->Node5 + + + - - -Node16->Node6 - - - - - - - - -Node16->Node11 - - - + + +Node15->Node10 + + + diff --git a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 74a798376..a65c0acbd 100644 --- a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -std::srand + +std::srand @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -std::strlen + +std::strlen @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,8 +57,8 @@ Node4 - -test1 + +test1 @@ -66,53 +66,53 @@ Node1->Node4 - - + + + + + + + +Node15 + + +test2 + + + + + +Node1->Node15 + + + Node16 - - -test2 + + +std::time - + Node1->Node16 - - - - - - - - -Node17 - - -std::time - - - - - -Node1->Node17 - - - + + + Node5 - - -std::vector::at + + +dsu::get @@ -120,53 +120,89 @@ Node4->Node5 - - + + + + + + + +Node10 + + +dsu::UnionSet + + + + + +Node4->Node10 + + + Node6 - - -dsu::get + + +dsu::get_max - - -Node4->Node6 - - - + + +Node5->Node6 + + + - - -Node11 - - -dsu::UnionSet + + +Node8 + + +dsu::get_min - - -Node4->Node11 - - - + + +Node5->Node8 + + + + + + + + +Node9 + + +dsu::size + + + + + +Node5->Node9 + + + Node7 - - -dsu::get_max + + +dsu::findSet @@ -174,206 +210,143 @@ Node6->Node7 - - - - - - - -Node9 - - -dsu::get_min - - - - - -Node6->Node9 - - - - - - - - -Node10 - - -dsu::size - - - - - -Node6->Node10 - - - - - - - - -Node8 - - -dsu::findSet - - - - - -Node7->Node8 - - - -Node8->Node8 - + + +Node7->Node7 + - - -Node9->Node8 - + + +Node8->Node7 + - - -Node10->Node8 - + + +Node9->Node7 + - - -Node11->Node8 - + + +Node10->Node7 + + + +Node11 + + +dsu::isSame + + + + + +Node10->Node11 + + + + + + Node12 - - -dsu::isSame + + +std::max - - -Node11->Node12 - - - + + +Node10->Node12 + + + Node13 - - -std::max + + +std::min - - -Node11->Node13 - - - + + +Node10->Node13 + + + Node14 - - -std::min - - - - - -Node11->Node14 - - - - - - - - -Node15 - + std::swap - - -Node11->Node15 - + + +Node10->Node14 + - - -Node12->Node8 - + + +Node11->Node7 + - - -Node16->Node5 - - - + + +Node15->Node5 + + + - - -Node16->Node6 - - - - - - - - -Node16->Node11 - - - + + +Node15->Node10 + + + diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html index cc9c50691..e0c5b4379 100644 --- a/d7/dba/cll_8h_source.html +++ b/d7/dba/cll_8h_source.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/cll/cll.h Source File @@ -11,9 +11,9 @@ - + @@ -43,28 +43,28 @@ MathJax.Hub.Config({ - + + -
@@ -160,7 +160,7 @@ $(function(){initNavTree('d7/dba/cll_8h_source.html','../../'); initResizable(); diff --git a/d7/dc1/classgraph_1_1_graph__inherit__graph.svg b/d7/dc1/classgraph_1_1_graph__inherit__graph.svg index fd185c14f..a5c125417 100644 --- a/d7/dc1/classgraph_1_1_graph__inherit__graph.svg +++ b/d7/dc1/classgraph_1_1_graph__inherit__graph.svg @@ -1,13 +1,14 @@ - - + + + + + +range_queries::perSegTree::newKid + + +Node1 + + +range_queries::perSegTree +::newKid + + + + + +Node2 + + +std::make_shared + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph_org.svg new file mode 100644 index 000000000..8ebef528d --- /dev/null +++ b/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph_org.svg @@ -0,0 +1,40 @@ + + + + + + +range_queries::perSegTree::newKid + + +Node1 + + +range_queries::perSegTree +::newKid + + + + + +Node2 + + +std::make_shared + + + + + +Node1->Node2 + + + + + + + + diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map index 61a0ff5db..714ca5166 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map +++ b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map @@ -1,5 +1,5 @@ - + diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg index 0e8638d3c..4e089f9e5 100644 --- a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg +++ b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg @@ -1,13 +1,14 @@ - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - + range_queries::perSegTree::update Node1 - -range_queries::perSegTree -::update + +range_queries::perSegTree +::update - + Node1->Node1 - - - + + + @@ -41,9 +78,9 @@ Node2 - -range_queries::perSegTree -::lazy + +range_queries::perSegTree +::lazy @@ -51,8 +88,8 @@ Node1->Node2 - - + + @@ -60,18 +97,36 @@ Node3 - -range_queries::perSegTree -::newKid + +range_queries::perSegTree +::newKid - + Node1->Node3 - - - + + + + + + + + +Node4 + + +std::make_shared + + + + + +Node1->Node4 + + + @@ -79,13 +134,43 @@ Node2->Node3 - - + + + + + + + +Node3->Node4 + + + + + + + + + + + + + + + + + + + + + - + Algorithms_in_C++: math/modular_inverse_fermat_little_theorem.cpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -129,20 +134,20 @@ Functions

Fermat's Little Theorem state that

\[Ï•(m) = m-1\]

-

where \(m\) is a prime number.

+

where \(m\) is a prime number.

\begin{eqnarray*} a \cdot x &≡& 1 \;\text{mod}\; m\\ x &≡& a^{-1} \;\text{mod}\; m \end{eqnarray*}

-

Using Euler's theorem we can modify the equation.

+

Using Euler's theorem we can modify the equation.

\[ a^{ϕ(m)} ≡ 1 \;\text{mod}\; m \]

(Where '^' denotes the exponent operator)

Here 'Ï•' is Euler's Totient Function. For modular inverse existence 'a' and 'm' must be relatively primes numbers. To apply Fermat's Little Theorem is necessary that 'm' must be a prime number. Generally in many competitive programming competitions 'm' is either 1000000007 (1e9+7) or 998244353.

-

We considered m as large prime (1e9+7). \(a^{ϕ(m)} ≡ 1 \;\text{mod}\; m\) (Using Euler's Theorem) \(ϕ(m) = m-1\) using Fermat's Little Theorem. \(a^{m-1} ≡ 1 \;\text{mod}\; m\) Now multiplying both side by \(a^{-1}\).

+

We considered m as large prime (1e9+7). \(a^{ϕ(m)} ≡ 1 \;\text{mod}\; m\) (Using Euler's Theorem) \(ϕ(m) = m-1\) using Fermat's Little Theorem. \(a^{m-1} ≡ 1 \;\text{mod}\; m\) Now multiplying both side by \(a^{-1}\).

\begin{eqnarray*} a^{m-1} \cdot a^{-1} &≡& a^{-1} \;\text{mod}\; m\\ a^{m-2} &≡& a^{-1} \;\text{mod}\; m @@ -165,12 +170,12 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\ int64_t binExpo ( - int64_t a, + int64_t a, - int64_t b, + int64_t b, @@ -235,7 +240,7 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\ int main ( - void ) + void ) @@ -275,7 +280,7 @@ Here is the call graph for this function:

diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index e65413f1c..dd8a1551c 100644 --- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,6 +1,6 @@ - + diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 5518d0f78..fb0eab3c9 100644 --- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + machine_learning::update_weights Node1 - -machine_learning::update -_weights + +machine_learning::update +_weights @@ -32,8 +33,8 @@ Node2 - -std::begin + +std::begin @@ -41,8 +42,8 @@ Node1->Node2 - - + + @@ -50,8 +51,8 @@ Node3 - -std::distance + +std::distance @@ -59,8 +60,8 @@ Node1->Node3 - - + + @@ -68,8 +69,8 @@ Node4 - -std::end + +std::end @@ -77,8 +78,8 @@ Node1->Node4 - - + + @@ -86,8 +87,8 @@ Node5 - -std::max + +std::max @@ -95,8 +96,8 @@ Node1->Node5 - - + + @@ -104,8 +105,8 @@ Node6 - -std::min + +std::min @@ -113,8 +114,8 @@ Node1->Node6 - - + + @@ -122,8 +123,8 @@ Node7 - -std::min_element + +std::min_element @@ -131,8 +132,26 @@ Node1->Node7 - - + + + + + + + +Node8 + + +machine_learning::sum + + + + + +Node1->Node8 + + + diff --git a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg b/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg index be22f88b0..ce0380d6b 100644 --- a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg @@ -1,20 +1,20 @@ - - - + + machine_learning::update_weights Node1 - -machine_learning::update -_weights + +machine_learning::update +_weights @@ -22,8 +22,8 @@ Node2 - -std::begin + +std::begin @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -std::distance + +std::distance @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -58,8 +58,8 @@ Node4 - -std::end + +std::end @@ -67,8 +67,8 @@ Node1->Node4 - - + + @@ -76,8 +76,8 @@ Node5 - -std::max + +std::max @@ -85,8 +85,8 @@ Node1->Node5 - - + + @@ -94,8 +94,8 @@ Node6 - -std::min + +std::min @@ -103,8 +103,8 @@ Node1->Node6 - - + + @@ -112,8 +112,8 @@ Node7 - -std::min_element + +std::min_element @@ -121,8 +121,26 @@ Node1->Node7 - - + + + + + + + +Node8 + + +machine_learning::sum + + + + + +Node1->Node8 + + + diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map index 5d80efcec..e0ac47463 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map @@ -1,13 +1,17 @@ - + - + - - - - - - - + + + + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 index a68d50638..8b62c9763 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 @@ -1 +1 @@ -2aac8c73bbc8837f7fcadeb2d6889e76 \ No newline at end of file +fb4b98105ab650a59ab2527c12036106 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg index ceb9977e2..713066402 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + machine_learning::save_u_matrix Node1 - -machine_learning::save -_u_matrix + +machine_learning::save +_u_matrix @@ -32,8 +33,8 @@ Node2 - -std::ofstream::close + +std::ofstream::close @@ -41,8 +42,8 @@ Node1->Node2 - - + + @@ -50,8 +51,8 @@ Node3 - -std::endl + +std::endl @@ -59,17 +60,17 @@ Node1->Node3 - - + + Node4 - - -std::pow + + +std::max @@ -77,17 +78,17 @@ Node1->Node4 - - + + Node5 - - -std::sqrt + + +std::min @@ -95,17 +96,17 @@ Node1->Node5 - - + + Node6 - - -std::strerror + + +std::pow @@ -113,8 +114,44 @@ Node1->Node6 - - + + + + + + + +Node7 + + +std::sqrt + + + + + +Node1->Node7 + + + + + + + + +Node8 + + +std::strerror + + + + + +Node1->Node8 + + + diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg index 071c623d5..43b71427b 100644 --- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg +++ b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg @@ -1,20 +1,20 @@ - - - + + machine_learning::save_u_matrix Node1 - -machine_learning::save -_u_matrix + +machine_learning::save +_u_matrix @@ -22,8 +22,8 @@ Node2 - -std::ofstream::close + +std::ofstream::close @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -std::endl + +std::endl @@ -49,17 +49,17 @@ Node1->Node3 - - + + Node4 - - -std::pow + + +std::max @@ -67,17 +67,17 @@ Node1->Node4 - - + + Node5 - - -std::sqrt + + +std::min @@ -85,17 +85,17 @@ Node1->Node5 - - + + Node6 - - -std::strerror + + +std::pow @@ -103,8 +103,44 @@ Node1->Node6 - - + + + + + + + +Node7 + + +std::sqrt + + + + + +Node1->Node7 + + + + + + + + +Node8 + + +std::strerror + + + + + +Node1->Node8 + + + diff --git a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg b/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg index a5233eca1..6a2db1361 100644 --- a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg +++ b/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg @@ -1,13 +1,14 @@ - - + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +struzik_search + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +binary_s + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::floor + + + + + +Node3->Node4 + + + + + + + + + + + + + diff --git a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..7cd52f4db --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,75 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +struzik_search + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +binary_s + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +std::floor + + + + + +Node3->Node4 + + + + + + + + diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.map b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.map new file mode 100644 index 000000000..b6e55ec3e --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.md5 b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.md5 new file mode 100644 index 000000000..661bb9c4a --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.md5 @@ -0,0 +1 @@ +f8cdcc8009682d51680a49cb18b1d5ca \ No newline at end of file diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg new file mode 100644 index 000000000..fa8bc8c79 --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg @@ -0,0 +1,83 @@ + + + + + + + + + + + + +struzik_search + + +Node1 + + +struzik_search + + + + + +Node2 + + +binary_s + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::floor + + + + + +Node2->Node3 + + + + + + + + + + + + + diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph_org.svg b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph_org.svg new file mode 100644 index 000000000..e9b645a61 --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph_org.svg @@ -0,0 +1,57 @@ + + + + + + +struzik_search + + +Node1 + + +struzik_search + + + + + +Node2 + + +binary_s + + + + + +Node1->Node2 + + + + + + + + +Node3 + + +std::floor + + + + + +Node2->Node3 + + + + + + + + diff --git a/d8/d8e/struct_node-members.html b/d8/d8e/struct_node-members.html index b46b533e2..bdc6dada5 100644 --- a/d8/d8e/struct_node-members.html +++ b/d8/d8e/struct_node-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -118,7 +123,7 @@ $(function(){initNavTree('db/d8b/struct_node.html','../../'); initResizable(); } diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html index b94fd0b14..63b8f6c1f 100644 --- a/d8/d90/iterative__tree__traversals_8cpp.html +++ b/d8/d90/iterative__tree__traversals_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: others/iterative_tree_traversals.cpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -131,10 +136,10 @@ Classes - + - +

Namespaces

namespace  others
namespace  others
 for vector
 
namespace  iterative_tree_traversals
namespace  iterative_tree_traversals
 Functions for the Traversal of the Tree algorithm.
 
@@ -184,7 +189,7 @@ Iterative Inorder Traversal of a tree - +
int main (void )void )
@@ -223,11 +228,11 @@ Iterative Inorder Traversal of a tree
380 std::cout << "\nIn-order test Passed!" << std::endl;
381
382 // Modifying tree for negative values.
-
383 root->data = -1;
-
384 root->left->data = -2;
-
385 root->right->data = -3;
-
386 root->left->left->data = -4;
-
387 root->left->right->data = -5;
+
383 root->data = -1;
+
384 root->left->data = -2;
+
385 root->right->data = -3;
+
386 root->left->left->data = -4;
+
387 root->left->right->data = -5;
388
389 std::cout << "\n| Tests for negative data values |" << std::endl;
390 test4(binaryTree, root); // run preorder-iterative test on negative values
@@ -244,7 +249,6 @@ Iterative Inorder Traversal of a tree
std::cout
others::iterative_tree_traversals::BinaryTree
defines the functions associated with the binary tree
Definition iterative_tree_traversals.cpp:67
others::iterative_tree_traversals::BinaryTree::createNewNode
Node * createNewNode(int64_t)
function that will create new node for insertion.
Definition iterative_tree_traversals.cpp:88
-
std::vector::data
T data(T... args)
test2
static void test2()
Self-implementations, 2nd test.
Definition dsu_path_compression.cpp:186
test1
static void test1()
Self-test implementations, 1st test.
Definition dsu_path_compression.cpp:169
std::endl
T endl(T... args)
@@ -273,7 +277,7 @@ Here is the call graph for this function:
static void test1 ( - others::iterative_tree_traversals::BinaryTree binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, @@ -313,7 +317,7 @@ Here is the call graph for this function:
205
206 // Printing the result storing preorder.
207 std::cout << "\nPreOrder Traversal Is : " << std::endl;
-
208 for (auto i : result) {
+
208 for (auto i : result) {
209 std::cout << i << " ";
210 }
211}
@@ -323,7 +327,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -340,7 +344,7 @@ Here is the call graph for this function: static void test2 ( - others::iterative_tree_traversals::BinaryTree binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, @@ -380,7 +384,7 @@ Here is the call graph for this function:
232
233 // Printing the result storing postorder.
234 std::cout << "\nPostOrder Traversal Is : " << std::endl;
-
235 for (auto i : result) {
+
235 for (auto i : result) {
236 std::cout << i << " ";
237 }
238}
@@ -388,7 +392,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -405,7 +409,7 @@ Here is the call graph for this function: static void test3 ( - others::iterative_tree_traversals::BinaryTree binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, @@ -445,7 +449,7 @@ Here is the call graph for this function:
259
260 // Printing the result storing inorder.
261 std::cout << "\nInOrder Traversal Is : " << std::endl;
-
262 for (auto i : result) {
+
262 for (auto i : result) {
263 std::cout << i << " ";
264 }
265}
@@ -453,7 +457,7 @@ Here is the call graph for this function:
Here is the call graph for this function:
-
+
@@ -470,7 +474,7 @@ Here is the call graph for this function: static void test4 ( - others::iterative_tree_traversals::BinaryTree binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, @@ -510,14 +514,14 @@ Here is the call graph for this function:
286
287 // Printing the result storing preorder.
288 std::cout << "\nPreOrder Traversal Is : " << std::endl;
-
289 for (auto i : result) {
+
289 for (auto i : result) {
290 std::cout << i << " ";
291 }
292}
Here is the call graph for this function:
-
+
@@ -534,7 +538,7 @@ Here is the call graph for this function: static void test5 ( - others::iterative_tree_traversals::BinaryTree binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, @@ -574,14 +578,14 @@ Here is the call graph for this function:
314
315 // Printing the result storing postorder.
316 std::cout << "\nPostOrder Traversal Is : " << std::endl;
-
317 for (auto i : result) {
+
317 for (auto i : result) {
318 std::cout << i << " ";
319 }
320}
Here is the call graph for this function:
-
+
@@ -598,7 +602,7 @@ Here is the call graph for this function: static void test6 ( - others::iterative_tree_traversals::BinaryTree binaryTree, + others::iterative_tree_traversals::BinaryTree binaryTree, @@ -638,14 +642,14 @@ Here is the call graph for this function:
341
342 // Printing the result storing inorder.
343 std::cout << "\nInOrder Traversal Is : " << std::endl;
-
344 for (auto i : result) {
+
344 for (auto i : result) {
345 std::cout << i << " ";
346 }
347}
Here is the call graph for this function:
-
+
@@ -656,7 +660,7 @@ Here is the call graph for this function: diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map index 5e3f6a4ac..5620855f4 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map +++ b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map @@ -8,6 +8,8 @@ - - + + + + diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 index cb7cc4edc..6ac0e70d0 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 +++ b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 @@ -1 +1 @@ -53cb7b811b678e5a93274a4f80f173bc \ No newline at end of file +a8a81ebb95550f2a1e93130bd20f07ee \ No newline at end of file diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg index 764608484..7875fb5a8 100644 --- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg +++ b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + deleteNode Node1 - -deleteNode + +deleteNode - + Node1->Node1 - - - + + + Node2 - - -std::vector::data + + +minValue - + Node1->Node2 - - - + + + - - -Node3 - - -minValue - - - - - -Node1->Node3 - - - - - - - - -Node3->Node3 - - - + + +Node2->Node2 + + + diff --git a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg b/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg index 60e212fbd..1f0d35ceb 100644 --- a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg +++ b/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg @@ -1,73 +1,55 @@ - - - + + deleteNode Node1 - -deleteNode + +deleteNode - + Node1->Node1 - - - + + + Node2 - - -std::vector::data + + +minValue - + Node1->Node2 - - - + + + - - -Node3 - - -minValue - - - - - -Node1->Node3 - - - - - - - - -Node3->Node3 - - - + + +Node2->Node2 + + + diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg index 974cb5fed..654be2a0a 100644 --- a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg +++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + main Node1 - -main + +main @@ -31,8 +32,8 @@ Node2 - -deleteAllNodes + +deleteAllNodes @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -49,8 +50,8 @@ Node3 - -deleteNode + +deleteNode @@ -58,44 +59,44 @@ Node1->Node3 - - + + - - -Node6 - + + +Node5 + insert - - -Node1->Node6 - - - + + +Node1->Node5 + + + - - -Node13 - - -levelOrder + + +Node12 + + +levelOrder - - -Node1->Node13 - - - + + +Node1->Node12 + + + @@ -103,197 +104,170 @@ Node2->Node2 - - + + - + Node3->Node3 - - - + + + Node4 - - -std::vector::data + + +minValue - + Node3->Node4 - - - + + + - - -Node5 - - -minValue - - - - - -Node3->Node5 - - - + + +Node4->Node4 + + + - + Node5->Node5 - - - + + + - - -Node6->Node6 - - - + + +Node6 + + +createNode + + + + + +Node5->Node6 + + + Node7 - - -createNode + + +getBalance - - -Node6->Node7 - - - - - - - - -Node8 - - -getBalance - - - - - -Node6->Node8 - - - - - - - - -Node11 - - -leftRotate - - - - - -Node6->Node11 - - - - - - - - -Node12 - - -rightRotate - - - - - -Node6->Node12 - - - - - - - - -Node9 - - -height - - - - - -Node8->Node9 - - - - - - - - -Node9->Node9 - - - + + +Node5->Node7 + + + Node10 - - -std::max + + +leftRotate - - -Node9->Node10 - - - + + +Node5->Node10 + + + - - -Node13->Node4 - - - + + +Node11 + + +rightRotate + + + + + +Node5->Node11 + + + + + + + + +Node8 + + +height + + + + + +Node7->Node8 + + + + + + + + +Node8->Node8 + + + + + + + + +Node9 + + +std::max + + + + + +Node8->Node9 + + + diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 1249d2056..1e6a6441d 100644 --- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -deleteAllNodes + +deleteAllNodes @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -deleteNode + +deleteNode @@ -48,44 +48,44 @@ Node1->Node3 - - + + - - -Node6 - + + +Node5 + insert - - -Node1->Node6 - - - + + +Node1->Node5 + + + - - -Node13 - - -levelOrder + + +Node12 + + +levelOrder - - -Node1->Node13 - - - + + +Node1->Node12 + + + @@ -93,197 +93,170 @@ Node2->Node2 - - + + - + Node3->Node3 - - - + + + Node4 - - -std::vector::data + + +minValue - + Node3->Node4 - - - + + + - - -Node5 - - -minValue - - - - - -Node3->Node5 - - - + + +Node4->Node4 + + + - + Node5->Node5 - - - + + + - - -Node6->Node6 - - - + + +Node6 + + +createNode + + + + + +Node5->Node6 + + + Node7 - - -createNode + + +getBalance - - -Node6->Node7 - - - - - - - - -Node8 - - -getBalance - - - - - -Node6->Node8 - - - - - - - - -Node11 - - -leftRotate - - - - - -Node6->Node11 - - - - - - - - -Node12 - - -rightRotate - - - - - -Node6->Node12 - - - - - - - - -Node9 - - -height - - - - - -Node8->Node9 - - - - - - - - -Node9->Node9 - - - + + +Node5->Node7 + + + Node10 - - -std::max + + +leftRotate - - -Node9->Node10 - - - + + +Node5->Node10 + + + - - -Node13->Node4 - - - + + +Node11 + + +rightRotate + + + + + +Node5->Node11 + + + + + + + + +Node8 + + +height + + + + + +Node7->Node8 + + + + + + + + +Node8->Node8 + + + + + + + + +Node9 + + +std::max + + + + + +Node8->Node9 + + + diff --git a/d8/df0/queue__using__array_8cpp.html b/d8/df0/queue__using__array_8cpp.html index 238c60930..8d82795fa 100644 --- a/d8/df0/queue__using__array_8cpp.html +++ b/d8/df0/queue__using__array_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/queue_using_array.cpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({ - + +
@@ -126,10 +131,10 @@ Classes - + - +

Namespaces

namespace  data_structures
namespace  data_structures
 for IO operations
 
namespace  queue_using_array
namespace  queue_using_array
 Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/) implementation.
 
@@ -165,7 +170,7 @@ Algorithm - +
int main (void )void )
@@ -229,7 +234,7 @@ Here is the call graph for this function:
- +
constexpr uint16_t max_size {10}uint16_t max_size {10}
@@ -251,7 +256,7 @@ Here is the call graph for this function: diff --git a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 19e55bb23..3ac0e7d99 100644 --- a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -3,12 +3,12 @@ - + - + - + diff --git a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 744e1da82..e694b2dbf 100644 --- a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + main @@ -67,8 +68,8 @@ Node3 - -FindNextGap + +FindNextGap @@ -76,8 +77,8 @@ Node2->Node3 - - + + @@ -85,8 +86,8 @@ Node5 - -std::swap + +std::swap @@ -94,8 +95,8 @@ Node2->Node5 - - + + @@ -103,8 +104,8 @@ Node4 - -std::max + +std::max @@ -112,8 +113,8 @@ Node3->Node4 - - + + diff --git a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 8d0900f5d..d2cff102c 100644 --- a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,12 +1,12 @@ - - - + + main @@ -57,8 +57,8 @@ Node3 - -FindNextGap + +FindNextGap @@ -66,8 +66,8 @@ Node2->Node3 - - + + @@ -75,8 +75,8 @@ Node5 - -std::swap + +std::swap @@ -84,8 +84,8 @@ Node2->Node5 - - + + @@ -93,8 +93,8 @@ Node4 - -std::max + +std::max @@ -102,8 +102,8 @@ Node3->Node4 - - + + diff --git a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg b/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg index 19c71cdea..c9116931d 100644 --- a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg +++ b/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + machine_learning::aystar_search::AyStarSearch::a_star_search Node1 - -machine_learning::aystar -_search::AyStarSearch:: -a_star_search + +machine_learning::aystar +_search::AyStarSearch:: +a_star_search @@ -33,8 +34,8 @@ Node2 - -std::set::begin + +std::set::begin @@ -42,8 +43,8 @@ Node1->Node2 - - + + @@ -51,8 +52,8 @@ Node3 - -std::set::emplace + +std::set::emplace @@ -60,8 +61,8 @@ Node1->Node3 - - + + @@ -69,8 +70,8 @@ Node4 - -std::set::empty + +std::set::empty @@ -78,17 +79,17 @@ Node1->Node4 - - + + Node5 - - -std::set::end + + +std::map::end @@ -96,17 +97,17 @@ Node1->Node5 - - + + Node6 - - -std::map::end + + +std::set::end @@ -114,8 +115,8 @@ Node1->Node6 - - + + @@ -123,8 +124,8 @@ Node7 - -std::set::erase + +std::set::erase @@ -132,17 +133,17 @@ Node1->Node7 - - + + Node8 - - -std::set::find + + +std::map::find @@ -150,17 +151,17 @@ Node1->Node8 - - + + Node9 - - -std::map::find + + +std::set::find @@ -168,19 +169,17 @@ Node1->Node9 - - + + Node10 - - -machine_learning::aystar -_search::AyStarSearch:: -Solution + + +std::make_shared @@ -188,33 +187,53 @@ Node1->Node10 - - - - - - - -Node10->Node9 - - - + + Node11 - + + +machine_learning::aystar +_search::AyStarSearch:: +Solution + + + + + +Node1->Node11 + + + + + + + + +Node11->Node8 + + + + + + + + +Node12 + std::vector::emplace_back - - -Node10->Node11 - + + +Node11->Node12 + diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg index e4ae87d4b..c11626f2a 100644 --- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg @@ -1,21 +1,21 @@ - - - + + machine_learning::aystar_search::AyStarSearch::a_star_search Node1 - -machine_learning::aystar -_search::AyStarSearch:: -a_star_search + +machine_learning::aystar +_search::AyStarSearch:: +a_star_search @@ -23,8 +23,8 @@ Node2 - -std::set::begin + +std::set::begin @@ -32,8 +32,8 @@ Node1->Node2 - - + + @@ -41,8 +41,8 @@ Node3 - -std::set::emplace + +std::set::emplace @@ -50,8 +50,8 @@ Node1->Node3 - - + + @@ -59,8 +59,8 @@ Node4 - -std::set::empty + +std::set::empty @@ -68,17 +68,17 @@ Node1->Node4 - - + + Node5 - - -std::set::end + + +std::map::end @@ -86,17 +86,17 @@ Node1->Node5 - - + + Node6 - - -std::map::end + + +std::set::end @@ -104,8 +104,8 @@ Node1->Node6 - - + + @@ -113,8 +113,8 @@ Node7 - -std::set::erase + +std::set::erase @@ -122,17 +122,17 @@ Node1->Node7 - - + + Node8 - - -std::set::find + + +std::map::find @@ -140,17 +140,17 @@ Node1->Node8 - - + + Node9 - - -std::map::find + + +std::set::find @@ -158,19 +158,17 @@ Node1->Node9 - - + + Node10 - - -machine_learning::aystar -_search::AyStarSearch:: -Solution + + +std::make_shared @@ -178,33 +176,53 @@ Node1->Node10 - - - - - - - -Node10->Node9 - - - + + Node11 - + + +machine_learning::aystar +_search::AyStarSearch:: +Solution + + + + + +Node1->Node11 + + + + + + + + +Node11->Node8 + + + + + + + + +Node12 + std::vector::emplace_back - - -Node10->Node11 - + + +Node11->Node12 + diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.map b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.map new file mode 100644 index 000000000..fe25dbea2 --- /dev/null +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.md5 b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.md5 new file mode 100644 index 000000000..aba8b815b --- /dev/null +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.md5 @@ -0,0 +1 @@ +d14d5243e43435e5f283d3393ac918e5 \ No newline at end of file diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg new file mode 100644 index 000000000..8c6b46ce1 --- /dev/null +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + + + + + + + +machine_learning::aystar_search::AyStarSearch::AyStarSearch + + +Node1 + + +machine_learning::aystar +_search::AyStarSearch:: +AyStarSearch + + + + + +Node2 + + +std::make_shared + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph_org.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph_org.svg new file mode 100644 index 000000000..097eb5abb --- /dev/null +++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph_org.svg @@ -0,0 +1,41 @@ + + + + + + +machine_learning::aystar_search::AyStarSearch::AyStarSearch + + +Node1 + + +machine_learning::aystar +_search::AyStarSearch:: +AyStarSearch + + + + + +Node2 + + +std::make_shared + + + + + +Node1->Node2 + + + + + + + + diff --git a/da/d0d/longest__common__string_8cpp.html b/da/d0d/longest__common__string_8cpp.html index 0a665f066..5967c64cc 100644 --- a/da/d0d/longest__common__string_8cpp.html +++ b/da/d0d/longest__common__string_8cpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: dynamic_programming/longest_common_string.cpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({ - + +
@@ -106,7 +111,7 @@ $(function(){initNavTree('da/d0d/longest__common__string_8cpp.html','../../'); i
-

contains the definition of the function longest_common_string_length +

contains the definition of the function longest_common_string_length More...

#include <cassert>
#include <iostream>
@@ -122,41 +127,41 @@ Include dependency graph for longest_common_string.cpp:

Classes

struct  TestCase - represents single example inputs and expected output of the function longest_common_string_length More...
+ represents single example inputs and expected output of the function longest_common_string_length More...
  - + - + - + - + - +

Functions

std::size_t longest_common_string_length (const std::string &string_a, const std::string &string_b)
 for std::vector
 computes the length of the longest common string created from input strings
 
std::vector< TestCase > get_test_cases ()
 
template<typename TestCases >
static void test_longest_common_string_length (const TestCases &test_cases)
 checks the function longest_common_string_length agains example data
 checks the function longest_common_string_length agains example data
 
template<typename TestCases >
static void test_longest_common_string_length_is_symmetric (const TestCases &test_cases)
 checks if the function longest_common_string_length returns the same result when its argument are flipped
 checks if the function longest_common_string_length returns the same result when its argument are flipped
 
std::string reverse_str (const std::string &in_str)
 reverses a given string
 
template<typename TestCases >
static void test_longest_common_string_length_for_reversed_inputs (const TestCases &test_cases)
 checks if the function longest_common_string_length returns the same result when its inputs are reversed
 checks if the function longest_common_string_length returns the same result when its inputs are reversed
 
static void tests ()
 runs all tests for longest_common_string_length funcion
 runs all tests for longest_common_string_length funcion
 
int main ()
 Main function.
 

Detailed Description

-

contains the definition of the function longest_common_string_length

-

the function longest_common_string_length computes the length of the longest common string which can be created of two input strings by removing characters from them

+

contains the definition of the function longest_common_string_length

+

the function longest_common_string_length computes the length of the longest common string which can be created of two input strings by removing characters from them

Author
Nikhil Arora
Piotr Idzik
@@ -170,12 +175,12 @@ Functions std::vector< TestCase > get_test_cases ( - ) + )
-
Returns
example data used in the tests of longest_common_string_length
+
Returns
example data used in the tests of longest_common_string_length
69 {
70 return {TestCase("", "", 0),
71 TestCase("ab", "ab", 2),
@@ -204,7 +209,7 @@ Functions std::size_t longest_common_string_length ( - const std::string & string_a, + const std::string & string_a, @@ -214,9 +219,8 @@ Functions
-

for std::vector

-

for assert for std::cout for std::string for std::move

-

computes the length of the longest common string created from input strings

+

computes the length of the longest common string created from input strings

+

for assert for std::cout for std::string for std::move for std::vector

has O(str_a.size()*str_b.size()) time and memory complexity

Parameters
@@ -266,7 +270,7 @@ Here is the call graph for this function: - +
string_afirst input string
int main (void )void )
@@ -348,7 +352,7 @@ template<typename Tes
-

checks the function longest_common_string_length agains example data

+

checks the function longest_common_string_length agains example data

Parameters
@@ -367,7 +371,7 @@ template<typename Tes
94 cur_tc.common_string_len);
95 }
96}
-
longest_common_string_length
std::size_t longest_common_string_length(const std::string &string_a, const std::string &string_b)
for std::vector
Definition longest_common_string.cpp:28
+
longest_common_string_length
std::size_t longest_common_string_length(const std::string &string_a, const std::string &string_b)
computes the length of the longest common string created from input strings
Definition longest_common_string.cpp:28
Here is the call graph for this function:
@@ -401,7 +405,7 @@ template<typename Tes
test_caseslist of test cases
-

checks if the function longest_common_string_length returns the same result when its inputs are reversed

+

checks if the function longest_common_string_length returns the same result when its inputs are reversed

Parameters
@@ -455,7 +459,7 @@ template<typename Tes
test_caseslist of test cases
-

checks if the function longest_common_string_length returns the same result when its argument are flipped

+

checks if the function longest_common_string_length returns the same result when its argument are flipped

Parameters
@@ -494,7 +498,7 @@ Here is the call graph for this function: - +
test_caseslist of test cases
static void tests ())
@@ -505,7 +509,7 @@ Here is the call graph for this function:
-

runs all tests for longest_common_string_length funcion

+

runs all tests for longest_common_string_length funcion

142 {
143 const auto test_cases = get_test_cases();
144 assert(test_cases.size() > 0);
@@ -534,7 +538,7 @@ Here is the call graph for this function:
diff --git a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map index 2bd312321..88437e457 100644 --- a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map +++ b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map @@ -1,6 +1,6 @@ - + diff --git a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5 b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5 index 354f8a42c..a2e1d74b6 100644 --- a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5 +++ b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5 @@ -1 +1 @@ -286ea9d93a7520e75925ead743933bdb \ No newline at end of file +316158dbc79b6fd882f0a06cff88034a \ No newline at end of file diff --git a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg index 3278d8991..dc76db4a0 100644 --- a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg +++ b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + prime_factorization Node1 - -prime_factorization + +prime_factorization @@ -31,8 +32,8 @@ Node2 - -std::make_pair + +std::make_pair @@ -40,26 +41,8 @@ Node1->Node2 - - - - - - - -Node3 - - -std::vector::push_back - - - - - -Node1->Node3 - - - + + diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg index 4f2e266d0..75e6d45c8 100644 --- a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg +++ b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + prime_factorization Node1 - -prime_factorization + +prime_factorization @@ -21,8 +21,8 @@ Node2 - -std::make_pair + +std::make_pair @@ -30,26 +30,8 @@ Node1->Node2 - - - - - - - -Node3 - - -std::vector::push_back - - - - - -Node1->Node3 - - - + + diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index e5c10929b..a81e81a96 100644 --- a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -4,11 +4,10 @@ - - + + - - - + + diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index d3d2240e7..b80f4f7c7 100644 --- a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -89922e74a2c1e3e1ba76b3951ff9f023 \ No newline at end of file +a678cdb0c261d5929793570d49f4c22a \ No newline at end of file diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 8fabe990e..3224f2e09 100644 --- a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + test Node1 - -test + +test @@ -31,8 +32,8 @@ Node2 - -math::iterativeFactorial + +math::iterativeFactorial @@ -40,27 +41,8 @@ Node1->Node2 - - - - - - - -Node3 - - -std::invalid_argument -::what - - - - - -Node1->Node3 - - - + + diff --git a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 7bb260dea..8a1b9e452 100644 --- a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + test Node1 - -test + +test @@ -21,8 +21,8 @@ Node2 - -math::iterativeFactorial + +math::iterativeFactorial @@ -30,27 +30,8 @@ Node1->Node2 - - - - - - - -Node3 - - -std::invalid_argument -::what - - - - - -Node1->Node3 - - - + + diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 9bb9e8506..b75d3dc63 100644 --- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,9 +1,7 @@ - - - + + + - - - + diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 1b28d4748..ff9ef3d38 100644 --- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -bc43a3d1ab9ddcc1988bc353c7b73655 \ No newline at end of file +93ed276ab8cae16f8df792181c059f11 \ No newline at end of file diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 5e4d30e71..c528640f7 100644 --- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + main Node1 - -main + +main @@ -31,8 +32,8 @@ Node2 - -test + +test @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -49,8 +50,8 @@ Node3 - -math::iterativeFactorial + +math::iterativeFactorial @@ -58,27 +59,8 @@ Node2->Node3 - - - - - - - -Node4 - - -std::invalid_argument -::what - - - - - -Node2->Node4 - - - + + diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 8b75ed8f9..a4d846971 100644 --- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -test + +test @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -math::iterativeFactorial + +math::iterativeFactorial @@ -48,27 +48,8 @@ Node2->Node3 - - - - - - - -Node4 - - -std::invalid_argument -::what - - - - - -Node2->Node4 - - - + + diff --git a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg index 0bf8d787a..3dd93bb4d 100644 --- a/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg +++ b/db/da0/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node__coll__graph.svg @@ -1,13 +1,14 @@ - - + + - + queue::enQueue Node1 - -queue::enQueue + +queue::enQueue @@ -31,8 +32,8 @@ Node2 - -queue::isEmptyQueue + +queue::isEmptyQueue @@ -40,8 +41,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +std::make_shared + + + + + +Node1->Node3 + + + diff --git a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg b/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg index c8935cfac..019e39ccf 100644 --- a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg +++ b/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + queue::enQueue Node1 - -queue::enQueue + +queue::enQueue @@ -21,8 +21,8 @@ Node2 - -queue::isEmptyQueue + +queue::isEmptyQueue @@ -30,8 +30,26 @@ Node1->Node2 - - + + + + + + + +Node3 + + +std::make_shared + + + + + +Node1->Node3 + + + diff --git a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg b/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg index 9f30d8904..404c02cb0 100644 --- a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg +++ b/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg @@ -1,13 +1,14 @@ - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - + divide_and_conquer::strassens_multiplication::Matrix::slice @@ -32,9 +69,11 @@ Node2 - - -std::vector::size + + +divide_and_conquer +::strassens_multiplication +::Matrix::Matrix @@ -42,13 +81,99 @@ Node1->Node2 - - + + + + + + + +Node5 + + +std::vector::size + + + + + +Node1->Node5 + + + + + + + + +Node3 + + +std::vector::emplace_back + + + + + +Node2->Node3 + + + + + + + + +Node4 + + +divide_and_conquer +::strassens_multiplication +::Matrix::size + + + + + +Node2->Node4 + + + + + + + + +Node4->Node5 + + + + + + + + + + + + + + + + + + + + + - + Algorithms_in_C++: data_structures::SegmentTree< T > Class Template Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -208,7 +213,7 @@ template<class T >
T data_structures::SegmentTree< T >::comb ( - T x, + T x, @@ -252,7 +257,7 @@ template<class T >
int data_structures::SegmentTree< T >::mid ( - int l, + int l, @@ -297,22 +302,22 @@ template<class T >
T data_structures::SegmentTree< T >::range_comb ( - int i, + int i, - int l, + int l, - int r, + int r, - int tl, + int tl, @@ -372,7 +377,7 @@ template<class T > T data_structures::SegmentTree< T >::range_comb ( - int l, + int l, @@ -421,22 +426,22 @@ template<class T > void data_structures::SegmentTree< T >::update ( - int i, + int i, - int l, + int l, - int r, + int r, - int pos, + int pos, @@ -494,7 +499,7 @@ template<class T > void data_structures::SegmentTree< T >::update ( - int pos, + int pos, @@ -537,7 +542,7 @@ Here is the call graph for this function: diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map index 30c1bc583..4fbd72e62 100644 --- a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map +++ b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map @@ -9,6 +9,6 @@ - + diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg index f0100b813..e6c76d923 100644 --- a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg +++ b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg @@ -1,13 +1,14 @@ - - + + - + test_1 Node1 - -test_1 + +test_1 @@ -31,8 +32,8 @@ Node2 - -std::array::at + +std::array::at @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -49,8 +50,8 @@ Node3 - -std::begin + +std::begin @@ -58,8 +59,8 @@ Node1->Node3 - - + + @@ -67,8 +68,8 @@ Node4 - -std::end + +std::end @@ -76,8 +77,8 @@ Node1->Node4 - - + + @@ -85,8 +86,8 @@ Node5 - -std::is_sorted + +std::is_sorted @@ -94,8 +95,80 @@ Node1->Node5 - - + + + + + + + +Node6 + + +sorting::pigeonSort + + + + + +Node1->Node6 + + + + + + + + +Node6->Node3 + + + + + + + + +Node6->Node4 + + + + + + + + +Node7 + + +std::max_element + + + + + +Node6->Node7 + + + + + + + + +Node8 + + +std::min_element + + + + + +Node6->Node8 + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg index 9461bb0eb..0c05a36eb 100644 --- a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg +++ b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + test_1 Node1 - -test_1 + +test_1 @@ -21,8 +21,8 @@ Node2 - -std::array::at + +std::array::at @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -std::begin + +std::begin @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,8 +57,8 @@ Node4 - -std::end + +std::end @@ -66,8 +66,8 @@ Node1->Node4 - - + + @@ -75,8 +75,8 @@ Node5 - -std::is_sorted + +std::is_sorted @@ -84,8 +84,80 @@ Node1->Node5 - - + + + + + + + +Node6 + + +sorting::pigeonSort + + + + + +Node1->Node6 + + + + + + + + +Node6->Node3 + + + + + + + + +Node6->Node4 + + + + + + + + +Node7 + + +std::max_element + + + + + +Node6->Node7 + + + + + + + + +Node8 + + +std::min_element + + + + + +Node6->Node8 + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map index 825fc12d9..2c24458c9 100644 --- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map +++ b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map @@ -1,11 +1,19 @@ - - - - - - - - - + + + + + + + + + + + + + + + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5 b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5 index d01ce4116..222ef999d 100644 --- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5 +++ b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5 @@ -1 +1 @@ -f68561e00fd7094fa22fde95f9e75bbd \ No newline at end of file +8152176e7427c6c5bdcca041f6e318cf \ No newline at end of file diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg index c3bb5fdfe..997513787 100644 --- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg +++ b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + test_2 Node1 - -test_2 + +test_2 @@ -31,8 +32,8 @@ Node2 - -std::array::at + +std::array::at @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -49,8 +50,8 @@ Node3 - -std::begin + +std::begin @@ -58,8 +59,8 @@ Node1->Node3 - - + + @@ -67,8 +68,8 @@ Node4 - -std::end + +std::end @@ -76,8 +77,8 @@ Node1->Node4 - - + + @@ -85,8 +86,8 @@ Node5 - -std::is_sorted + +std::is_sorted @@ -94,8 +95,80 @@ Node1->Node5 - - + + + + + + + +Node6 + + +sorting::pigeonSort + + + + + +Node1->Node6 + + + + + + + + +Node6->Node3 + + + + + + + + +Node6->Node4 + + + + + + + + +Node7 + + +std::max_element + + + + + +Node6->Node7 + + + + + + + + +Node8 + + +std::min_element + + + + + +Node6->Node8 + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg index f7d8286df..5c9495f31 100644 --- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg +++ b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + test_2 Node1 - -test_2 + +test_2 @@ -21,8 +21,8 @@ Node2 - -std::array::at + +std::array::at @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -std::begin + +std::begin @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,8 +57,8 @@ Node4 - -std::end + +std::end @@ -66,8 +66,8 @@ Node1->Node4 - - + + @@ -75,8 +75,8 @@ Node5 - -std::is_sorted + +std::is_sorted @@ -84,8 +84,80 @@ Node1->Node5 - - + + + + + + + +Node6 + + +sorting::pigeonSort + + + + + +Node1->Node6 + + + + + + + + +Node6->Node3 + + + + + + + + +Node6->Node4 + + + + + + + + +Node7 + + +std::max_element + + + + + +Node6->Node7 + + + + + + + + +Node8 + + +std::min_element + + + + + +Node6->Node8 + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index d79eff9fd..f7f8945f0 100644 --- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,25 +1,35 @@ - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 8ce8be83a..7aa284475 100644 --- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -4cf7ac44efc7c179870fc750e6506711 \ No newline at end of file +8c5e697481dbacd4b478821c96588c39 \ No newline at end of file diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 5e3ea44ad..b477af22f 100644 --- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + main Node1 - -main + +main @@ -31,8 +32,8 @@ Node2 - -test_1 + +test_1 @@ -40,44 +41,44 @@ Node1->Node2 - - + + - - -Node7 - - -test_2 + + +Node10 + + +test_2 - - -Node1->Node7 - - - + + +Node1->Node10 + + + - - -Node8 - - -test_3 + + +Node11 + + +test_3 - - -Node1->Node8 - - - + + +Node1->Node11 + + + @@ -85,8 +86,8 @@ Node3 - -std::array::at + +std::array::at @@ -94,8 +95,8 @@ Node2->Node3 - - + + @@ -103,8 +104,8 @@ Node4 - -std::begin + +std::begin @@ -112,8 +113,8 @@ Node2->Node4 - - + + @@ -121,8 +122,8 @@ Node5 - -std::end + +std::end @@ -130,8 +131,8 @@ Node2->Node5 - - + + @@ -139,8 +140,8 @@ Node6 - -std::is_sorted + +std::is_sorted @@ -148,80 +149,170 @@ Node2->Node6 - - + + - - -Node7->Node3 - - - + + +Node7 + + +sorting::pigeonSort + + + + + +Node2->Node7 + + + - + Node7->Node4 - - - + + + - + Node7->Node5 - - - + + + - - -Node7->Node6 - - - + + +Node8 + + +std::max_element - - -Node8->Node3 - - - + + +Node7->Node8 + + + - - -Node8->Node4 - - - + + +Node9 + + +std::min_element - - -Node8->Node5 - - - + + +Node7->Node9 + + + - - -Node8->Node6 - - - + + +Node10->Node3 + + + + + + + + +Node10->Node4 + + + + + + + + +Node10->Node5 + + + + + + + + +Node10->Node6 + + + + + + + + +Node10->Node7 + + + + + + + + +Node11->Node3 + + + + + + + + +Node11->Node4 + + + + + + + + +Node11->Node5 + + + + + + + + +Node11->Node6 + + + + + + + + +Node11->Node7 + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index c4c876a1f..baf4330ba 100644 --- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -test_1 + +test_1 @@ -30,44 +30,44 @@ Node1->Node2 - - + + - - -Node7 - - -test_2 + + +Node10 + + +test_2 - - -Node1->Node7 - - - + + +Node1->Node10 + + + - - -Node8 - - -test_3 + + +Node11 + + +test_3 - - -Node1->Node8 - - - + + +Node1->Node11 + + + @@ -75,8 +75,8 @@ Node3 - -std::array::at + +std::array::at @@ -84,8 +84,8 @@ Node2->Node3 - - + + @@ -93,8 +93,8 @@ Node4 - -std::begin + +std::begin @@ -102,8 +102,8 @@ Node2->Node4 - - + + @@ -111,8 +111,8 @@ Node5 - -std::end + +std::end @@ -120,8 +120,8 @@ Node2->Node5 - - + + @@ -129,8 +129,8 @@ Node6 - -std::is_sorted + +std::is_sorted @@ -138,80 +138,170 @@ Node2->Node6 - - + + - - -Node7->Node3 - - - + + +Node7 + + +sorting::pigeonSort + + + + + +Node2->Node7 + + + - + Node7->Node4 - - - + + + - + Node7->Node5 - - - + + + - - -Node7->Node6 - - - + + +Node8 + + +std::max_element - - -Node8->Node3 - - - + + +Node7->Node8 + + + - - -Node8->Node4 - - - + + +Node9 + + +std::min_element - - -Node8->Node5 - - - + + +Node7->Node9 + + + - - -Node8->Node6 - - - + + +Node10->Node3 + + + + + + + + +Node10->Node4 + + + + + + + + +Node10->Node5 + + + + + + + + +Node10->Node6 + + + + + + + + +Node10->Node7 + + + + + + + + +Node11->Node3 + + + + + + + + +Node11->Node4 + + + + + + + + +Node11->Node5 + + + + + + + + +Node11->Node6 + + + + + + + + +Node11->Node7 + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map index 92aa73bf3..13c6d2844 100644 --- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map +++ b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map @@ -1,11 +1,19 @@ - - - - - - - - - + + + + + + + + + + + + + + + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5 b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5 index d1acde36f..3e44ddbd4 100644 --- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5 +++ b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5 @@ -1 +1 @@ -2236c2698c8f3c1a69a4162f5b11aa29 \ No newline at end of file +0bba5cd68fd96a0263b3a7f724f48940 \ No newline at end of file diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg index d6ee04062..61175135d 100644 --- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg +++ b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + test_3 Node1 - -test_3 + +test_3 @@ -31,8 +32,8 @@ Node2 - -std::array::at + +std::array::at @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -49,8 +50,8 @@ Node3 - -std::begin + +std::begin @@ -58,8 +59,8 @@ Node1->Node3 - - + + @@ -67,8 +68,8 @@ Node4 - -std::end + +std::end @@ -76,8 +77,8 @@ Node1->Node4 - - + + @@ -85,8 +86,8 @@ Node5 - -std::is_sorted + +std::is_sorted @@ -94,8 +95,80 @@ Node1->Node5 - - + + + + + + + +Node6 + + +sorting::pigeonSort + + + + + +Node1->Node6 + + + + + + + + +Node6->Node3 + + + + + + + + +Node6->Node4 + + + + + + + + +Node7 + + +std::max_element + + + + + +Node6->Node7 + + + + + + + + +Node8 + + +std::min_element + + + + + +Node6->Node8 + + + diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg index e63172c53..8d33471f9 100644 --- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg +++ b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + test_3 Node1 - -test_3 + +test_3 @@ -21,8 +21,8 @@ Node2 - -std::array::at + +std::array::at @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -std::begin + +std::begin @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -57,8 +57,8 @@ Node4 - -std::end + +std::end @@ -66,8 +66,8 @@ Node1->Node4 - - + + @@ -75,8 +75,8 @@ Node5 - -std::is_sorted + +std::is_sorted @@ -84,8 +84,80 @@ Node1->Node5 - - + + + + + + + +Node6 + + +sorting::pigeonSort + + + + + +Node1->Node6 + + + + + + + + +Node6->Node3 + + + + + + + + +Node6->Node4 + + + + + + + + +Node7 + + +std::max_element + + + + + +Node6->Node7 + + + + + + + + +Node8 + + +std::min_element + + + + + +Node6->Node8 + + + diff --git a/dd/da8/struct_segment_intersection-members.html b/dd/da8/struct_segment_intersection-members.html index 8f7dcac5c..af0ba73d5 100644 --- a/dd/da8/struct_segment_intersection-members.html +++ b/dd/da8/struct_segment_intersection-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({ - + +
@@ -113,7 +118,7 @@ $(function(){initNavTree('d4/db4/struct_segment_intersection.html','../../'); in diff --git a/dd/dad/power__of__two_8cpp__incl.map b/dd/dad/power__of__two_8cpp__incl.map index e70ff4db1..926346bb4 100644 --- a/dd/dad/power__of__two_8cpp__incl.map +++ b/dd/dad/power__of__two_8cpp__incl.map @@ -1,5 +1,5 @@ - + diff --git a/dd/dad/power__of__two_8cpp__incl.svg b/dd/dad/power__of__two_8cpp__incl.svg index 86d4aa178..2c2a7d9b3 100644 --- a/dd/dad/power__of__two_8cpp__incl.svg +++ b/dd/dad/power__of__two_8cpp__incl.svg @@ -1,13 +1,14 @@ - - + + - + others::recursive_tree_traversals::BT::preorder Node1 - -others::recursive_tree -_traversals::BT::preorder + +others::recursive_tree +_traversals::BT::preorder - + Node1->Node1 - - - + + + Node2 - - -std::vector::data + + +std::vector::push_back - + Node1->Node2 - - - - - - - - -Node3 - - -std::vector::push_back - - - - - -Node1->Node3 - - - + + + diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph_org.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph_org.svg index fdb15c166..ba9f88b60 100644 --- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph_org.svg +++ b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph_org.svg @@ -1,65 +1,47 @@ - - - + + others::recursive_tree_traversals::BT::preorder Node1 - -others::recursive_tree -_traversals::BT::preorder + +others::recursive_tree +_traversals::BT::preorder - + Node1->Node1 - - - + + + Node2 - - -std::vector::data + + +std::vector::push_back - + Node1->Node2 - - - - - - - - -Node3 - - -std::vector::push_back - - - - - -Node1->Node3 - - - + + + diff --git a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.map b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.map index 794f9bd57..9a2ec56da 100644 --- a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.map +++ b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.map @@ -4,6 +4,6 @@ - + diff --git a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg index 2203ccf95..6cce23ab4 100644 --- a/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg +++ b/dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg @@ -1,13 +1,14 @@ - - + + - + test2 Node1 - -test2 + +test2 Node2 - - -std::vector::at + + +dsu::getParents @@ -40,17 +41,17 @@ Node1->Node2 - - + + Node3 - - -dsu::getParents + + +dsu::unionSet @@ -58,96 +59,78 @@ Node1->Node3 - - + + Node4 - - -dsu::unionSet + + +dsu::findSet - - -Node1->Node4 - - - + + +Node3->Node4 + + + Node5 - - -dsu::findSet + + +dsu::isSame - - -Node4->Node5 - - - + + +Node3->Node5 + + + Node6 - - -dsu::isSame - - - - - -Node4->Node6 - - - - - - - - -Node7 - + std::swap - - -Node4->Node7 - + + +Node3->Node6 + - - -Node5->Node5 - + + +Node4->Node4 + - - -Node6->Node5 - + + +Node5->Node4 + diff --git a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg b/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg index 52abf6309..922bdcb43 100644 --- a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg +++ b/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg @@ -1,28 +1,28 @@ - - - + + test2 Node1 - -test2 + +test2 Node2 - - -std::vector::at + + +dsu::getParents @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -dsu::getParents + + +dsu::unionSet @@ -48,96 +48,78 @@ Node1->Node3 - - + + Node4 - - -dsu::unionSet + + +dsu::findSet - - -Node1->Node4 - - - + + +Node3->Node4 + + + Node5 - - -dsu::findSet + + +dsu::isSame - - -Node4->Node5 - - - + + +Node3->Node5 + + + Node6 - - -dsu::isSame - - - - - -Node4->Node6 - - - - - - - - -Node7 - + std::swap - - -Node4->Node7 - + + +Node3->Node6 + - - -Node5->Node5 - + + +Node4->Node4 + - - -Node6->Node5 - + + +Node5->Node4 + diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 5beb1f196..74926c3f2 100644 --- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,24 +1,21 @@ - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index a35760d05..3e062e9cd 100644 --- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -3734f901414259dc254bf079e55a28a7 \ No newline at end of file +dac6f7ebedee78270a24ea5e106a593a \ No newline at end of file diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index f4c27f232..ccd5ddaf9 100644 --- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + main Node1 - -main + +main @@ -31,8 +32,8 @@ Node2 - -test1 + +test1 @@ -40,35 +41,35 @@ Node1->Node2 - - + + - - -Node9 - - -test2 + + +Node8 + + +test2 - - -Node1->Node9 - - - + + +Node1->Node8 + + + Node3 - - -std::vector::at + + +dsu::getParents @@ -76,17 +77,17 @@ Node2->Node3 - - + + Node4 - - -dsu::getParents + + +dsu::unionSet @@ -94,125 +95,98 @@ Node2->Node4 - - + + Node5 - - -dsu::unionSet + + +dsu::findSet - - -Node2->Node5 - - - + + +Node4->Node5 + + + Node6 - - -dsu::findSet + + +dsu::isSame - - -Node5->Node6 - - - + + +Node4->Node6 + + + Node7 - - -dsu::isSame - - - - - -Node5->Node7 - - - - - - - - -Node8 - + std::swap - - -Node5->Node8 - + + +Node4->Node7 + - - -Node6->Node6 - + + +Node5->Node5 + - - -Node7->Node6 - + + +Node6->Node5 + - - -Node9->Node3 - - - + + +Node8->Node3 + + + - - -Node9->Node4 - - - - - - - - -Node9->Node5 - - - + + +Node8->Node4 + + + diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 6a5e087a9..7ec306376 100644 --- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -test1 + +test1 @@ -30,35 +30,35 @@ Node1->Node2 - - + + - - -Node9 - - -test2 + + +Node8 + + +test2 - - -Node1->Node9 - - - + + +Node1->Node8 + + + Node3 - - -std::vector::at + + +dsu::getParents @@ -66,17 +66,17 @@ Node2->Node3 - - + + Node4 - - -dsu::getParents + + +dsu::unionSet @@ -84,125 +84,98 @@ Node2->Node4 - - + + Node5 - - -dsu::unionSet + + +dsu::findSet - - -Node2->Node5 - - - + + +Node4->Node5 + + + Node6 - - -dsu::findSet + + +dsu::isSame - - -Node5->Node6 - - - + + +Node4->Node6 + + + Node7 - - -dsu::isSame - - - - - -Node5->Node7 - - - - - - - - -Node8 - + std::swap - - -Node5->Node8 - + + +Node4->Node7 + - - -Node6->Node6 - + + +Node5->Node5 + - - -Node7->Node6 - + + +Node6->Node5 + - - -Node9->Node3 - - - + + +Node8->Node3 + + + - - -Node9->Node4 - - - - - - - - -Node9->Node5 - - - + + +Node8->Node4 + + + diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map index 2e09e66fa..0177e75c0 100644 --- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map +++ b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map @@ -1,17 +1,15 @@ - - - - - - - - - - - - - - - + + + + + + + + + + + + + diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 index e8faa9e36..9d27fa8f4 100644 --- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 +++ b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 @@ -1 +1 @@ -a3e4fc595f68f5f5c6f4bb4998aa79f5 \ No newline at end of file +ab21a1520d6bf943e1068afc32495f26 \ No newline at end of file diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg index e0c3153eb..08c62ef30 100644 --- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg +++ b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + test1 Node1 - -test1 + +test1 Node2 - - -std::vector::at + + +dsu::getParents @@ -40,17 +41,17 @@ Node1->Node2 - - + + Node3 - - -dsu::getParents + + +dsu::unionSet @@ -58,96 +59,78 @@ Node1->Node3 - - + + Node4 - - -dsu::unionSet + + +dsu::findSet - - -Node1->Node4 - - - + + +Node3->Node4 + + + Node5 - - -dsu::findSet + + +dsu::isSame - - -Node4->Node5 - - - + + +Node3->Node5 + + + Node6 - - -dsu::isSame - - - - - -Node4->Node6 - - - - - - - - -Node7 - + std::swap - - -Node4->Node7 - + + +Node3->Node6 + - - -Node5->Node5 - + + +Node4->Node4 + - - -Node6->Node5 - + + +Node5->Node4 + diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg index 26eff9fb1..3b5220459 100644 --- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg +++ b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg @@ -1,28 +1,28 @@ - - - + + test1 Node1 - -test1 + +test1 Node2 - - -std::vector::at + + +dsu::getParents @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node3 - - -dsu::getParents + + +dsu::unionSet @@ -48,96 +48,78 @@ Node1->Node3 - - + + Node4 - - -dsu::unionSet + + +dsu::findSet - - -Node1->Node4 - - - + + +Node3->Node4 + + + Node5 - - -dsu::findSet + + +dsu::isSame - - -Node4->Node5 - - - + + +Node3->Node5 + + + Node6 - - -dsu::isSame - - - - - -Node4->Node6 - - - - - - - - -Node7 - + std::swap - - -Node4->Node7 - + + +Node3->Node6 + - - -Node5->Node5 - + + +Node4->Node4 + - - -Node6->Node5 - + + +Node5->Node4 + diff --git a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg index 52ad2ec71..f4ef37de5 100644 --- a/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg +++ b/df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg @@ -1,13 +1,14 @@ - - + + + + + +get_final_status + + +Node1 + + +get_final_status + + + + + +Node2 + + +sortcol + + + + + +Node1->Node2 + + + + + + + + + + + + + diff --git a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph_org.svg b/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph_org.svg new file mode 100644 index 000000000..73c1a6028 --- /dev/null +++ b/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph_org.svg @@ -0,0 +1,39 @@ + + + + + + +get_final_status + + +Node1 + + +get_final_status + + + + + +Node2 + + +sortcol + + + + + +Node1->Node2 + + + + + + + + diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map index 8e4b1f8ef..af0bb23f9 100644 --- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map +++ b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map @@ -1,13 +1,17 @@ - - - - - + + + + + + + - - - - - + + + + + + + diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 index 90d430623..074c3375d 100644 --- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 +++ b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 @@ -1 +1 @@ -4e5290926b9e1e211639b0debef59b71 \ No newline at end of file +f5516df712d2062d62bc91fd5718e722 \ No newline at end of file diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg index 2bab7ce08..f31f81db0 100644 --- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg +++ b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + test Node1 - -test + +test @@ -31,8 +32,8 @@ Node2 - -FCFS::addProcess + +FCFS::addProcess @@ -40,17 +41,17 @@ Node1->Node2 - - + + Node6 - - -FCFS::scheduleForFcfs + + +get_final_status @@ -58,8 +59,26 @@ Node1->Node6 - - + + + + + + + +Node8 + + +FCFS::scheduleForFcfs + + + + + +Node1->Node8 + + + @@ -67,8 +86,8 @@ Node3 - -std::unordered_set::end + +std::unordered_set::end @@ -76,8 +95,8 @@ Node2->Node3 - - + + @@ -85,9 +104,9 @@ Node4 - -std::unordered_set -::find + +std::unordered_set +::find @@ -95,8 +114,8 @@ Node2->Node4 - - + + @@ -104,9 +123,9 @@ Node5 - -std::unordered_set -::insert + +std::unordered_set +::insert @@ -114,8 +133,26 @@ Node2->Node5 - - + + + + + + + +Node7 + + +sortcol + + + + + +Node6->Node7 + + + diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg index 07dc123f8..d8b6cda99 100644 --- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg +++ b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + test Node1 - -test + +test @@ -21,8 +21,8 @@ Node2 - -FCFS::addProcess + +FCFS::addProcess @@ -30,17 +30,17 @@ Node1->Node2 - - + + Node6 - - -FCFS::scheduleForFcfs + + +get_final_status @@ -48,8 +48,26 @@ Node1->Node6 - - + + + + + + + +Node8 + + +FCFS::scheduleForFcfs + + + + + +Node1->Node8 + + + @@ -57,8 +75,8 @@ Node3 - -std::unordered_set::end + +std::unordered_set::end @@ -66,8 +84,8 @@ Node2->Node3 - - + + @@ -75,9 +93,9 @@ Node4 - -std::unordered_set -::find + +std::unordered_set +::find @@ -85,8 +103,8 @@ Node2->Node4 - - + + @@ -94,9 +112,9 @@ Node5 - -std::unordered_set -::insert + +std::unordered_set +::insert @@ -104,8 +122,26 @@ Node2->Node5 - - + + + + + + + +Node7 + + +sortcol + + + + + +Node6->Node7 + + + diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 3807f81c8..019245566 100644 --- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -1,15 +1,19 @@ - - - - - - - + + + + + + + + + - + - - - + + + + + diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index eaa1035c4..8b8f32198 100644 --- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -808d0f9e1715c140df401dbe64267a8c \ No newline at end of file +06a59461d7d4976cb5e2234e5948888a \ No newline at end of file diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 7644218bf..5e10adcc5 100644 --- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -1,13 +1,14 @@ - - + + + - - + main Node1 - -main + +main @@ -31,8 +32,8 @@ Node2 - -test + +test @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -49,8 +50,8 @@ Node3 - -FCFS::addProcess + +FCFS::addProcess @@ -58,17 +59,17 @@ Node2->Node3 - - + + Node7 - - -FCFS::scheduleForFcfs + + +get_final_status @@ -76,8 +77,26 @@ Node2->Node7 - - + + + + + + + +Node9 + + +FCFS::scheduleForFcfs + + + + + +Node2->Node9 + + + @@ -85,8 +104,8 @@ Node4 - -std::unordered_set::end + +std::unordered_set::end @@ -94,8 +113,8 @@ Node3->Node4 - - + + @@ -103,9 +122,9 @@ Node5 - -std::unordered_set -::find + +std::unordered_set +::find @@ -113,8 +132,8 @@ Node3->Node5 - - + + @@ -122,9 +141,9 @@ Node6 - -std::unordered_set -::insert + +std::unordered_set +::insert @@ -132,8 +151,26 @@ Node3->Node6 - - + + + + + + + +Node8 + + +sortcol + + + + + +Node7->Node8 + + + diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 912a96f78..db75ceb3a 100644 --- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -test + +test @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -39,8 +39,8 @@ Node3 - -FCFS::addProcess + +FCFS::addProcess @@ -48,17 +48,17 @@ Node2->Node3 - - + + Node7 - - -FCFS::scheduleForFcfs + + +get_final_status @@ -66,8 +66,26 @@ Node2->Node7 - - + + + + + + + +Node9 + + +FCFS::scheduleForFcfs + + + + + +Node2->Node9 + + + @@ -75,8 +93,8 @@ Node4 - -std::unordered_set::end + +std::unordered_set::end @@ -84,8 +102,8 @@ Node3->Node4 - - + + @@ -93,9 +111,9 @@ Node5 - -std::unordered_set -::find + +std::unordered_set +::find @@ -103,8 +121,8 @@ Node3->Node5 - - + + @@ -112,9 +130,9 @@ Node6 - -std::unordered_set -::insert + +std::unordered_set +::insert @@ -122,8 +140,26 @@ Node3->Node6 - - + + + + + + + +Node8 + + +sortcol + + + + + +Node7->Node8 + + + diff --git a/df/d47/stack_8hpp.html b/df/d47/stack_8hpp.html index 5199fa0c8..2be7ffe5f 100644 --- a/df/d47/stack_8hpp.html +++ b/df/d47/stack_8hpp.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/stack.hpp File Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -134,7 +139,7 @@ Classes diff --git a/df/d47/stack_8hpp_source.html b/df/d47/stack_8hpp_source.html index 4add50978..4535c63db 100644 --- a/df/d47/stack_8hpp_source.html +++ b/df/d47/stack_8hpp_source.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: data_structures/stack.hpp Source File @@ -11,9 +11,9 @@ - + @@ -43,28 +43,28 @@ MathJax.Hub.Config({
- + + -
@@ -158,7 +158,7 @@ $(function(){initNavTree('df/d47/stack_8hpp_source.html','../../'); initResizabl
46 /** Add new item to the stack */
47 void push(const value_type& item) {
-
48 auto newNode = std::make_shared<Node<value_type>>();
+
48 auto newNode = std::make_shared<Node<value_type>>();
49 newNode->data = item;
50 newNode->next = stackTop;
51 stackTop = newNode;
@@ -214,6 +214,7 @@ $(function(){initNavTree('df/d47/stack_8hpp_source.html','../../'); initResizabl
std::endl
T endl(T... args)
std::shared_ptr::get
T get(T... args)
+
std::make_shared
T make_shared(T... args)
node.hpp
Provides Node class and related utilities.
@@ -224,7 +225,7 @@ $(function(){initNavTree('df/d47/stack_8hpp_source.html','../../'); initResizabl diff --git a/df/d4a/namespaceselection__sort__recursive.html b/df/d4a/namespaceselection__sort__recursive.html index c6c4d005e..a2a140653 100644 --- a/df/d4a/namespaceselection__sort__recursive.html +++ b/df/d4a/namespaceselection__sort__recursive.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: selection_sort_recursive Namespace Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -113,7 +118,7 @@ $(function(){initNavTree('df/d4a/namespaceselection__sort__recursive.html','../. diff --git a/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html b/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html index 36cb9a1d8..19920e68d 100644 --- a/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html +++ b/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -120,7 +125,7 @@ $(function(){initNavTree('d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html' diff --git a/df/d57/chaining_8cpp__incl.svg b/df/d57/chaining_8cpp__incl.svg index e7c9351bd..68e98c777 100644 --- a/df/d57/chaining_8cpp__incl.svg +++ b/df/d57/chaining_8cpp__incl.svg @@ -1,13 +1,14 @@ - - + + - - - -greedy_algorithms::dijkstra::minimum_distance - - -Node1 - - -greedy_algorithms:: -dijkstra::minimum_distance - - - - - -Node1->Node1 - - - - - - - - - - - - - diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af6cb29ca6dc5771439f6ea7262058a71_cgraph_org.svg b/df/dcb/greedy__algorithms_2dijkstra_8cpp_af6cb29ca6dc5771439f6ea7262058a71_cgraph_org.svg deleted file mode 100644 index e116ba6d8..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af6cb29ca6dc5771439f6ea7262058a71_cgraph_org.svg +++ /dev/null @@ -1,31 +0,0 @@ - - - - - - -greedy_algorithms::dijkstra::minimum_distance - - -Node1 - - -greedy_algorithms:: -dijkstra::minimum_distance - - - - - -Node1->Node1 - - - - - - - - diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map b/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map deleted file mode 100644 index 4a520890d..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map +++ /dev/null @@ -1,6 +0,0 @@ - - - - - - diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5 b/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5 deleted file mode 100644 index 5274c167a..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5 +++ /dev/null @@ -1 +0,0 @@ -493345e972ec158313c96f0090a8b93c \ No newline at end of file diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg b/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg deleted file mode 100644 index 26a5e32b4..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg +++ /dev/null @@ -1,75 +0,0 @@ - - - - - - - - - - - -greedy_algorithms::dijkstra::dijkstra - - -Node1 - - -greedy_algorithms:: -dijkstra::dijkstra - - - - - -Node2 - - -greedy_algorithms:: -dijkstra::minimum_distance - - - - - -Node1->Node2 - - - - - - - - -Node2->Node2 - - - - - - - - - - - - - diff --git a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg b/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg deleted file mode 100644 index 669537b91..000000000 --- a/df/dcb/greedy__algorithms_2dijkstra_8cpp_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg +++ /dev/null @@ -1,50 +0,0 @@ - - - - - - -greedy_algorithms::dijkstra::dijkstra - - -Node1 - - -greedy_algorithms:: -dijkstra::dijkstra - - - - - -Node2 - - -greedy_algorithms:: -dijkstra::minimum_distance - - - - - -Node1->Node2 - - - - - - - - -Node2->Node2 - - - - - - - - diff --git a/df/dcb/namespacestrings.html b/df/dcb/namespacestrings.html index d4ccbecf3..faa6278a1 100644 --- a/df/dcb/namespacestrings.html +++ b/df/dcb/namespacestrings.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: strings Namespace Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -99,15 +104,25 @@ $(function(){initNavTree('df/dcb/namespacestrings.html','../../'); initResizable
+
+Namespaces
strings Namespace Reference
-

Algorithms with strings. +

String algorithms. More...

+ + + + + +

+Namespaces

namespace  boyer_moore
 Functions for the Boyer Moore algorithm implementation.
 

Detailed Description

-

Algorithms with strings.

+

String algorithms.

for std::vector STL

+

Algorithms with strings.

for assert for IO operations for string

Algorithms with strings

@@ -116,7 +131,7 @@ $(function(){initNavTree('df/dcb/namespacestrings.html','../../'); initResizable diff --git a/df/dcb/namespacestrings.js b/df/dcb/namespacestrings.js new file mode 100644 index 000000000..5a4e720e9 --- /dev/null +++ b/df/dcb/namespacestrings.js @@ -0,0 +1,4 @@ +var namespacestrings = +[ + [ "boyer_moore", "d0/dbc/namespacestrings_1_1boyer__moore.html", "d0/dbc/namespacestrings_1_1boyer__moore" ] +]; \ No newline at end of file diff --git a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html index 14d3bf2ad..0aab75773 100644 --- a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html +++ b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -291,7 +296,7 @@ $(function(){initNavTree('df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
* @brief Main function
* @returns 0 on exit
*/
-
int main() {
+
int main() {
test(); // Run self-test implementation.
return 0;
}
@@ -299,7 +304,7 @@ $(function(){initNavTree('df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
test
static void test()
Self-test implementations.
Definition generate_parentheses.cpp:82
-
main
int main()
Main function.
Definition generate_parentheses.cpp:110
+
main
int main()
Main function.
Definition generate_parentheses.cpp:110
math
for IO operations
math::quadraticEquation
std::array< std::complex< long double >, 2 > quadraticEquation(long double a, long double b, long double c)
Quadratic equation calculator.
Definition quadratic_equations_complex_numbers.cpp:53
@@ -312,7 +317,7 @@ $(function(){initNavTree('df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg index f35dc9416..242bf3889 100644 --- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg +++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg @@ -1,13 +1,14 @@ - - + + - + main Node1 - -main + +main @@ -31,8 +32,8 @@ Node2 - -graph::addEdge + +graph::addEdge @@ -40,8 +41,8 @@ Node1->Node2 - - + + @@ -58,8 +59,8 @@ Node1->Node3 - - + + @@ -76,8 +77,8 @@ Node1->Node4 - - + + @@ -85,8 +86,8 @@ Node7 - -tests + +tests @@ -94,8 +95,8 @@ Node1->Node7 - - + + @@ -148,8 +149,8 @@ Node7->Node2 - - + + @@ -157,8 +158,8 @@ Node7->Node3 - - + + @@ -166,8 +167,8 @@ Node7->Node4 - - + + diff --git a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index baa4409f7..4d9743526 100644 --- a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -1,19 +1,19 @@ - - - + + main Node1 - -main + +main @@ -21,8 +21,8 @@ Node2 - -graph::addEdge + +graph::addEdge @@ -30,8 +30,8 @@ Node1->Node2 - - + + @@ -48,8 +48,8 @@ Node1->Node3 - - + + @@ -66,8 +66,8 @@ Node1->Node4 - - + + @@ -75,8 +75,8 @@ Node7 - -tests + +tests @@ -84,8 +84,8 @@ Node1->Node7 - - + + @@ -138,8 +138,8 @@ Node7->Node2 - - + + @@ -147,8 +147,8 @@ Node7->Node3 - - + + @@ -156,8 +156,8 @@ Node7->Node4 - - + + diff --git a/df/de3/classqueue-members.html b/df/de3/classqueue-members.html index d638150cf..15bf658ac 100644 --- a/df/de3/classqueue-members.html +++ b/df/de3/classqueue-members.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: Member List @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -123,7 +128,7 @@ $(function(){initNavTree('db/da9/classqueue.html','../../'); initResizable(); }) diff --git a/df/de5/classbacktracking_1_1generate__parentheses.html b/df/de5/classbacktracking_1_1generate__parentheses.html index ce01a8f36..716fb741d 100644 --- a/df/de5/classbacktracking_1_1generate__parentheses.html +++ b/df/de5/classbacktracking_1_1generate__parentheses.html @@ -3,7 +3,7 @@ - + Algorithms_in_C++: backtracking::generate_parentheses Class Reference @@ -11,9 +11,9 @@ - + @@ -43,18 +43,23 @@ MathJax.Hub.Config({
- + +
@@ -191,17 +196,17 @@ Here is the call graph for this function:
void backtracking::generate_parentheses::makeStrings ( - std::string str, + std::string str, - int n, + int n, - int closed, + int closed, @@ -262,7 +267,7 @@ Here is the call graph for this function:
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map index 3c2bedfd7..b81fa5ac2 100644 --- a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map +++ b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map @@ -3,6 +3,6 @@ - + diff --git a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg index 92a336969..25e591538 100644 --- a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg +++ b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg @@ -1,13 +1,14 @@ - - + +