-| ▼Nciphers | Algorithms for encryption and decryption |
-| ►Nelliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange |
-| CPoint | Definition of struct Point |
-| CHillCipher | Implementation of Hill Cipher algorithm |
-| ▼Ndata_structures | Data Structures algorithms |
-| ►Nlinked_list | |
-| Clink | |
-| Clist | |
-| CNode | |
-| ►Nlist_array | |
+| ►Nciphers | Algorithms for encryption and decryption |
+| ►Nelliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange |
+| CPoint | Definition of struct Point |
+| CHillCipher | Implementation of Hill Cipher algorithm |
+| ►Ndata_structures | Data Structures algorithms |
+| ►Nlinked_list | |
+| Clink | |
+| Clist | |
+| CNode | |
+| ►Nlist_array | |
| Clist | Structure of List with supporting methods |
-| ►Nqueue_using_array | |
-| CQueue_Array | Queue_Array class containing the main data and also index of head and tail of the array |
-| ►Nsparse_table | |
+| ►Nqueue_using_array | |
+| CQueue_Array | Queue_Array class containing the main data and also index of head and tail of the array |
+| ►Nsparse_table | |
| CSparse_table | |
-| ►Nstack_using_queue | |
-| CStack | Stack Class implementation for basic methods of Stack Data Structure |
-| ►Ntree_234 | |
+| ►Nstack_using_queue | |
+| CStack | Stack Class implementation for basic methods of Stack Data Structure |
+| ►Ntree_234 | |
| CNode | 2-3-4 tree node class |
| CTree234 | 2-3-4 tree class |
-| ►Ntrie_using_hashmap | |
-| ►CTrie | Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix |
-| CNode | Struct representing a trie node |
-| CNode | |
-| CSkipList | |
-| Ctrie | Trie implementation for small-case English alphabets a-z |
-| ▼Ndouble_hashing | An implementation of hash table using double hashing algorithm |
-| CEntry | |
-| ▼Ngeometry | Geometry algorithms |
-| ►Njarvis | |
+| ►Ntrie_using_hashmap | |
+| ►CTrie | Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix |
+| CNode | Struct representing a trie node |
+| CNode | |
+| CSkipList | |
+| Ctrie | Trie implementation for small-case English alphabets a-z |
+| ►Ndouble_hashing | An implementation of hash table using double hashing algorithm |
+| CEntry | |
+| ►Ngeometry | Geometry algorithms |
+| ►Njarvis | |
| CConvexhull | |
| CPoint | |
-| ▼Ngraph | Graph Algorithms |
-| ►Nis_graph_bipartite | |
-| CGraph | Class for representing graph as an adjacency list |
-| CGraph | |
-| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
-| CLowestCommonAncestor | |
-| CRootedTree | |
-| ▼Nlinear_probing | An implementation of hash table using linear probing algorithm |
-| CEntry | |
-| ▼Nmachine_learning | A* search algorithm |
-| ►Naystar_search | |
-| ►CAyStarSearch | A class defining A* search algorithm. for some initial state and final state |
-| Ccomparison_operator | Custom comparator for open_list |
-| CInfo | Struct that handles all the information related to the current state |
-| CEightPuzzle | A class defining EightPuzzle/15-Puzzle game |
-| ►Nneural_network | |
+| ►Ngraph | Graph Algorithms |
+| ►Nis_graph_bipartite | |
+| CGraph | Class for representing graph as an adjacency list |
+| CGraph | |
+| CHKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
+| CLowestCommonAncestor | |
+| CRootedTree | |
+| ►Nlinear_probing | An implementation of hash table using linear probing algorithm |
+| CEntry | |
+| ►Nmachine_learning | A* search algorithm |
+| ►Naystar_search | |
+| ►CAyStarSearch | A class defining A* search algorithm. for some initial state and final state |
+| Ccomparison_operator | Custom comparator for open_list |
+| CInfo | Struct that handles all the information related to the current state |
+| CEightPuzzle | A class defining EightPuzzle/15-Puzzle game |
+| ►Nneural_network | |
| ►Nlayers | |
| CDenseLayer | |
| CNeuralNetwork | |
-| Cadaline | |
-| ▼Nmath | For M_PI definition and pow() |
-| ►Nncr_modulo_p | |
+| Cadaline | |
+| ►Nmath | For M_PI definition and pow() |
+| ►Nncr_modulo_p | |
| CNCRModuloP | Class which contains all methods required for calculating nCr mod p |
-| ▼Noperations_on_datastructures | For std::vector |
-| ►Ninorder_traversal_of_bst | |
-| CNode | A Node structure representing a single node in BST |
-| ►Nreverse_binary_tree | |
-| CBinaryTree | A Binary Tree class that implements a Binary Search Tree (BST) by default |
-| CNode | A Node struct that represents a single node in a Binary Tree |
-| ►Ntrie_operations | |
-| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
-| ▼Nothers | For vector |
-| ►Niterative_tree_traversals | |
+| ►Noperations_on_datastructures | For std::vector |
+| ►Ncircular_linked_list | |
+| CCircularLinkedList | A class that implements a Circular Linked List |
+| CNode | A Node struct that represents a single Node in a Binary Tree |
+| ►Ninorder_traversal_of_bst | |
+| CNode | A Node structure representing a single node in BST |
+| ►Nreverse_binary_tree | |
+| CBinaryTree | A Binary Tree class that implements a Binary Search Tree (BST) by default |
+| CNode | A Node struct that represents a single node in a Binary Tree |
+| ►Ntrie_operations | |
+| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
+| ►Nothers | For vector |
+| ►Niterative_tree_traversals | |
| CBinaryTree | Defines the functions associated with the binary tree |
| CNode | Defines the structure of a node of the tree |
-| ►Nlru_cache | |
-| CLRUCache | LRU cache class |
-| ►Npostfix_expression | |
+| ►Nlru_cache | |
+| CLRUCache | LRU cache class |
+| ►Npostfix_expression | |
| CStack | Creates an array to be used as stack for storing values |
-| ▼Nprobability | Probability algorithms |
-| ►Ngeometric_dist | |
-| Cgeometric_distribution | A class to model the geometric distribution |
-| ►Nwindowed_median | |
+| ►Nprobability | Probability algorithms |
+| ►Ngeometric_dist | |
+| Cgeometric_distribution | A class to model the geometric distribution |
+| ►Nwindowed_median | |
| 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 |
-| ►Nheavy_light_decomposition | |
+| ►Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
+| CEntry | |
+| ►Nrange_queries | Algorithms and Data Structures that support range queries and updates |
+| ►Nheavy_light_decomposition | |
| CHLD | The Heavy-Light Decomposition class |
| CSG | Segment Tree, to store heavy chains |
| CTree | A Basic Tree, which supports binary lifting |
-| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
-| CNode | |
-| ▼Nsearch | For std::vector |
-| ►Nsublist_search | |
+| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
+| CNode | |
+| ►Nsearch | For std::vector |
+| ►Nsublist_search | |
| CNode | A Node structure representing a single link Node in a linked list |
-| ▼Nstatistics | Statistical algorithms |
-| Cstats_computer1 | |
-| Cstats_computer2 | |
-| ▼Nstd | STL namespace |
-| Cis_arithmetic< uint128_t > | |
-| Cis_arithmetic< uint256_t > | |
-| Cis_integral< uint128_t > | |
-| Cis_integral< uint256_t > | |
-| Cis_unsigned< uint128_t > | |
-| Cis_unsigned< uint256_t > | |
-| ▼Cbinary_search_tree | The Binary Search Tree class |
-| Cbst_node | A struct to represent a node in the Binary Search Tree |
-| CBtree | |
-| Ccll | |
-| CCompare | Comparator class for priority queue |
-| Ccompare | |
-| CComplex | Class Complex to represent complex numbers as a field |
-| CCycleCheck | |
-| Cdouble_linked_list | |
-| Cdsu | Disjoint sets union data structure, class based representation |
-| CEasterYearMonthDay | For IO operations |
-| CEdge | |
-| CFCFS | Class which implements the FCFS scheduling algorithm |
-| CFenwickTree | |
-| CGraph | |
-| Chash_chain | Chain class with a given modulus |
-| CItem | |
-| Clarge_number | |
-| Clinkedlist | |
-| Clist | |
-| CMinHeap | |
-| CMinHeapNode | |
-| Cmst | |
-| CNode | |
-| Cnode | |
-| CPoint | |
-| Cquery | |
-| CQueue | |
-| Cqueue | |
-| CRBtree | |
-| CSegmentIntersection | |
-| CSolution | |
-| Cstack | |
-| Cstack_linkedList | |
-| CTestCases | Class encapsulating the necessary test cases |
-| Ctower | |
-| ▼CTrie | |
-| CTrieNode | |
+| ►Nstatistics | Statistical algorithms |
+| Cstats_computer1 | |
+| Cstats_computer2 | |
+| ►Nstd | STL namespace |
+| Cis_arithmetic< uint128_t > | |
+| Cis_arithmetic< uint256_t > | |
+| Cis_integral< uint128_t > | |
+| Cis_integral< uint256_t > | |
+| Cis_unsigned< uint128_t > | |
+| Cis_unsigned< uint256_t > | |
+| ►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 |
+| CComplex | Class Complex to represent complex numbers as a field |
+| CCycleCheck | |
+| Cdouble_linked_list | |
+| Cdsu | Disjoint sets union data structure, class based representation |
+| CEasterYearMonthDay | For IO operations |
+| CEdge | |
+| CFCFS | Class which implements the FCFS scheduling algorithm |
+| CFenwickTree | |
+| CGraph | |
+| Chash_chain | Chain class with a given modulus |
+| CItem | |
+| Clarge_number | |
+| Clinkedlist | |
+| Clist | |
+| CMinHeap | |
+| CMinHeapNode | |
+| Cmst | |
+| CNode | |
+| Cnode | |
+| CPoint | |
+| Cquery | |
+| CQueue | |
+| Cqueue | |
+| CRBtree | |
+| CSegmentIntersection | |
+| CSolution | |
+| Cstack | |
+| Cstack_linkedList | |
+| CTestCases | Class encapsulating the necessary test cases |
+| Ctower | |
+| ►CTrie | |
+| CTrieNode | |
| Cuint128_t | Class for 128-bit unsigned integer |
| Cuint256_t | Class for 256-bit unsigned integer |
diff --git a/annotated_dup.js b/annotated_dup.js
index 8e76be849..cf94bf039 100644
--- a/annotated_dup.js
+++ b/annotated_dup.js
@@ -75,6 +75,10 @@ var annotated_dup =
] ]
] ],
[ "operations_on_datastructures", "da/d6d/namespaceoperations__on__datastructures.html", [
+ [ "circular_linked_list", null, [
+ [ "CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list" ],
+ [ "Node", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node" ]
+ ] ],
[ "inorder_traversal_of_bst", null, [
[ "Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node" ]
] ],
@@ -137,8 +141,8 @@ var annotated_dup =
[ "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", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "compare", "d1/db3/structcompare.html", null ],
+ [ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "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 ],
diff --git a/classes.html b/classes.html
index 4795117d0..45cd11402 100644
--- a/classes.html
+++ b/classes.html
@@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
@@ -130,7 +130,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
index 7f693e43e..c072bbbf3 100644
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@@ -1,7 +1,7 @@
-
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
index 71a2ef85e..e0f5a9998 100644
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
@@ -1,7 +1,7 @@
-