# Algorithms_in_C++: Class List

Loading...
Searching...
No Matches
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:

ciphers | Algorithms for encryption and decryption
elliptic_curve_key_exchange | Namespace elliptic_curve_key_exchange
Point | Definition of struct Point
HillCipher | Implementation of Hill Cipher algorithm
data_structures | For IO operations
linked_list |
link |
list |
Node |
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
sparse_table |
Sparse_table |
stack_using_queue |
Stack | Stack Class implementation for basic methods of Stack Data Structure
tree_234 |
Node | 2-3-4 tree node class
Tree234 | 2-3-4 tree class
trie_using_hashmap |
Trie | 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
Node | Struct representing a trie node
Bitset | Simple bitset implementation for bloom filter
BloomFilter | Bloom filter template 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 | For std::vector
grahamscan |
Point |
jarvis |
Convexhull |
Point |
graph | Graph Algorithms
is_graph_bipartite |
Graph | Class for representing graph as an adjacency list
Graph |
HKGraph | Represents Bipartite graph for Hopcroft Karp implementation
LowestCommonAncestor |
RootedTree |
linear_probing | An implementation of hash table using linear probing algorithm
Entry |
machine_learning | A* search algorithm
aystar_search |
AyStarSearch | A class defining A* search algorithm. for some initial state and final state
comparison_operator | Custom comparator for open_list
Info | Struct that handles all the information related to the current state
EightPuzzle | A class defining EightPuzzle/15-Puzzle game
neural_network |
layers |
DenseLayer |
NeuralNetwork |
adaline |
math | For std::rand
ncr_modulo_p |
NCRModuloP | Class which contains all methods required for calculating nCr mod p
Point |
operations_on_datastructures | For std::vector
circular_linked_list |
CircularLinkedList | A class that implements a Circular Linked List
Node | A Node struct that represents a single Node in a Binary Tree
inorder_traversal_of_bst |
Node | A Node structure representing a single node in BST
reverse_binary_tree |
BinaryTree | A Binary Tree class that implements a Binary Search Tree (BST) by default
Node | A Node struct that represents a single node in a Binary Tree
trie_operations |
Tnode | Class defining the structure of trie node and containing the methods to perform operations on them
others | For `vector`
iterative_tree_traversals |
BinaryTree | Defines the functions associated with the binary tree
Node | Defines the structure of a node of the tree
lru_cache |
LRUCache | LRU cache class
postfix_expression |
Stack | Creates an array to be used as stack for storing values
recursive_tree_traversals |
BT | BT used to make the entire structure of the binary tree and the functions associated with the binary tree
Node | The structure to hold Nodes of the tree
probability | Probability algorithms
geometric_dist |
geometric_distribution | A class to model the geometric distribution
windowed_median |
WindowedMedian | A class to calculate the median of a leading sliding window at the back of a stream of integer 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 |
HLD | The Heavy-Light Decomposition class
SG | Segment Tree, to store heavy chains
Tree | A Basic Tree, which supports binary lifting
perSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min
Node |
search | For std::vector
sublist_search |
Node | A Node structure representing a single link Node in a linked list
statistics | Statistical algorithms
stats_computer1 |
stats_computer2 |
std | STL namespace
is_arithmetic< uint128_t > |
is_arithmetic< uint256_t > |
is_integral< uint128_t > |
is_integral< uint256_t > |
is_unsigned< uint128_t > |
is_unsigned< uint256_t > |
binary_search_tree | The Binary Search Tree class
bst_node | A struct to represent a node in the Binary Search Tree
Btree |
cll |
Compare | Comparator class for priority queue
compare |
Complex | Class Complex to represent complex numbers as a field
CycleCheck |
double_linked_list |
dsu | Disjoint sets union data structure, class based representation
EasterYearMonthDay | For IO operations
Edge |
FCFS | Class which implements the FCFS scheduling algorithm
FenwickTree |
Graph |
hash_chain | Chain class with a given modulus
Item |
large_number |
linkedlist |
list |
MinHeap |
MinHeapNode |
mst |
Node |
node |
Point |
query |
Queue |
queue |
RBtree |
SegmentIntersection |
Solution |
stack |
stack_linkedList |
TestCases | Class encapsulating the necessary test cases
tower |
Trie |
TrieNode |
uint128_t | Class for 128-bit unsigned integer
uint256_t | Class for 256-bit unsigned integer