Class List
Here are the classes, structs, unions and interfaces with brief descriptions:

ciphers | Algorithms for encryption and decryption
HillCipher | Implementation of Hill Cipher algorithm
data_structures | Data Structures algorithms
linked_list |
link |
list |
list_array |
list | Structure of List with supporting methods
queue_using_array |
Queue_Array | Queue_Array class containing the main data and also index of head and tail of the array
tree_234 |
Node | 2-3-4 tree node class
Tree234 | 2-3-4 tree class
Node |
SkipList |
trie | Trie implementation for small-case English alphabets `a-z`
double_hashing | An implementation of hash table using double hashing algorithm
Entry |
geometry | Geometry algorithms
jarvis |
Point |
Convexhull |
graph | Graph Algorithms
is_graph_bipartite |
Graph | Class for representing graph as an adjacency list
Graph |
HKGraph | Represents Bipartite graph for Hopcroft Karp implementation
RootedTree |
LowestCommonAncestor |
linear_probing | An implementation of hash table using linear probing algorithm
Entry |
machine_learning | Machine learning algorithms
neural_network |
layers |
DenseLayer |
NeuralNetwork |
adaline |
math | For std::vector
ncr_modulo_p |
NCRModuloP | Class which contains all methods required for calculating nCr mod p
others | Other algorithms
postfix_expression |
Stack | Creates an array to be used as stack for storing values
quadratic_probing | An implementation of hash table using quadratic probing algorithm
Entry |
range_queries | Algorithms and Data Structures that support range queries and updates
heavy_light_decomposition |
Tree | A Basic Tree, which supports binary lifting
SG | Segment Tree, to store heavy chains
HLD | The Heavy-Light Decomposition class
perSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min
Node |
statistics | Statistical algorithms
stats_computer1 |
stats_computer2 |
binary_search_tree | The Binary Search Tree class
bst_node | A struct to represent a node in the Binary Search Tree
Btree |
cll |
compare |
Complex | Class Complex to represent complex numbers as a field
CycleCheck |
double_linked_list |
Edge |
FenwickTree |
Graph |
hash_chain | Chain class with a given modulus
Item |
large_number |
linkedlist |
list |
MinHeap |
MinHeapNode |
mst |
Node |
node |
Point |
query |
Queue |
queue |
SegmentIntersection |
Solution |
stack |
stack_linkedList |
tower |
Trie |
TrieNode |