# Algorithms_in_C++: Class Hierarchy

Class Hierarchy

Go to the graphical class hierarchy

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

machine_learning::adaline |
Btree |
cll |
compare |
Complex | Class Complex to represent complex numbers as a field
geometry::jarvis::Convexhull |
CycleCheck |
machine_learning::neural_network::layers::DenseLayer |
double_linked_list |
Edge |
quadratic_probing::Entry |
linear_probing::Entry |
double_hashing::Entry |
FenwickTree |
Graph |
graph::is_graph_bipartite::Graph | Class for representing graph as an adjacency list
graph::Graph |
graph::RootedTree |
hash_chain | Chain class with a given modulus
ciphers::HillCipher | Implementation of Hill Cipher algorithm
Item |
large_number |
linkedlist |
list |
graph::LowestCommonAncestor |
MinHeap |
MinHeapNode |
mst |
machine_learning::neural_network::NeuralNetwork |
data_structure::Node |
Node |
node< Kind > |
node< Type > |
Point |
geometry::jarvis::Point |
query |
queue< Kind > |
Queue |
Queue_Array |
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_structure::SkipList |
Solution |
stack< Type > |
stack_linkedList |
statistics::stats_computer1< T > |
statistics::stats_computer2< T > |
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
trie |
Trie |
Trie::TrieNode |