@@ -123,7 +128,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });
| CSparse_table | |
| ►Nstack_using_queue | |
| CStack | Stack Class implementation for basic methods of Stack Data Structure |
-
| ►Ntreap | |
+
| ►Ntreap | Functions for the Treap algorithm implementation |
| CTreap | Struct representation of the treap |
| ►Ntree_234 | |
| CNode | 2-3-4 tree node class |
@@ -156,7 +161,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });
| CLowestCommonAncestor | |
| CRootedTree | |
| ►Ngreedy_algorithms | For std::vector |
-
| ►Ndijkstra | |
+
| ►Ndijkstra | Functions for the Dijkstra algorithm implementation |
| CGraph | Wrapper class for storing a graph |
| ►Nhashing | Hashing algorithms |
| ►Nsha256 | |
@@ -208,7 +213,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(); });
| CWindowedMedian | A class to calculate the median of a leading sliding window at the back of a stream of integer values |
| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
| CEntry | |
-
| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
+
| ►Nrange_queries | For std::vector |
| ►Nheavy_light_decomposition | |
| CHLD | The Heavy-Light Decomposition class |
| CSG | Segment 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 > | |
-
| ►Nstrings | Algorithms with strings |
-
| ►Nboyer_moore | |
+
| ►Nstrings | String algorithms |
+
| ►Nboyer_moore | Functions for the Boyer Moore algorithm implementation |
| Cpattern | A structure representing all the data we need to search the preprocessed pattern in text |
| ►Cbinary_search_tree | The Binary Search Tree class |
| Cbst_node | A struct to represent a node in the Binary Search Tree |
| CBtree | |
| Ccll | |
-
| Ccompare | |
-
| CCompare | Comparator class for priority queue |
+
| CCompare | Comparator class for priority queue |
+
| Ccompare | |
| CComplex | Class 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 | |
| Cstack | For std::invalid_argument |
| Cstack_linkedList | |
-
| CTestCase | Single example inputs and expected output of the function longest_common_string_length |
+
| CTestCase | Single example inputs and expected output of the function longest_common_string_length |
| CTestCases | Class 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_treeBinaryTree (operations_on_datastructures::reverse_binary_tree)BinaryTree (others::iterative_tree_traversals)Bitset (data_structures)BloomFilter (data_structures)binary_search_tree::bst_nodeBT (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)cllComparecompareAyStarSearch::comparison_operator (machine_learning::aystar_search)ComplexConvexhull (geometry::jarvis)CycleCheck
- D
- DenseLayer (machine_learning::neural_network::layers)
- double_linked_list
- dsu
@@ -124,7 +129,7 @@ $(function(){initNavTree('classes.html',''); initResizable(); });
FCFSfenwick_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)GraphGraph (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)MinHeapMinHeapNodemst
- 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)NodeNode (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)
+
queryQueuequeueQueue_Array (data_structures::queue_using_array)
- R
- RBtree
- RootedTree (graph)
@@ -157,7 +162,7 @@ $(function(){initNavTree('classes.html',''); initResizable(); });
SegmentIntersectionSegmentTree (data_structures)SG (range_queries::heavy_light_decomposition)SkipList (data_structures)SolutionSparse_table (data_structures::sparse_table)Stack (data_structures::stack_using_queue)Stack (others::postfix_expression)stackstack_linkedListstats_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
+
TestCaseTestCasesTnode (operations_on_datastructures::trie_operations)towerTreap (data_structures::treap)Tree (range_queries::heavy_light_decomposition)Tree234 (data_structures::tree_234)Trie (data_structures::trie_using_hashmap)Trietrie (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
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)));
@@ -258,7 +263,7 @@ Here is the call graph for this function:
1.10.0
+ 
1.10.0