# Algorithms_in_C++: Class Hierarchy

Loading...
Searching...
No Matches
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

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