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

[detail level 1234]

▼Nciphers	Algorithms for encryption and decryption
CHillCipher	Implementation of Hill Cipher algorithm
▼Ndata_structures	Data Structures algorithms
▼Nlinked_list
Clink
Clist
▼Nqueue_using_array
CQueue_Array	Queue_Array class containing the main data and also index of head and tail of the array
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	Machine learning algorithms
▼Nneural_network
▼Nlayers
CDenseLayer
CNeuralNetwork
Cadaline
▼Nmath	For std::vector
▼Nncr_modulo_p
CNCRModuloP	Class which contains all methods required for calculating nCr mod p
▼Nothers	Other algorithms
▼Npostfix_expression
CStack	Creates an array to be used as stack for storing 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
CHLD	The Heavy-Light Decomposition class
CSG	Segment Tree, to store heavy chains
CTree	A Basic Tree, which supports binary lifting
▼Nstatistics	Statistical algorithms
Cstats_computer1
Cstats_computer2
CBtree
Ccll
Ccompare
CComplex	Class Complex to represent complex numbers as a field
CCycleCheck
Cdouble_linked_list
CEdge
CFenwickTree
CGraph
Chash_chain	Chain class with a given modulus
CItem
Clarge_number
Clinkedlist
Clist
CMinHeap
CMinHeapNode
Cmst
CNode
Cnode
CPoint
Cquery
Cqueue
CQueue
CSegmentIntersection
CSolution
Cstack
Cstack_linkedList
Ctower
▼CTrie
CTrieNode