Define a point */

* @brief represents single example inputs and expected output of the function * ::longest_common_string_length */

* Store large unsigned numbers as a C++ vector * The class provides convenience functions to add a * digit to the number, perform multiplication of

* neural_network::layers::DenseLayer class is used to store all necessary * information about the layers (i.e. neurons, activation and kernel). This

* @brief K-Nearest Neighbors (Knn) class using Euclidean distance as * distance metric. */

namespace utils * @brief Class which contains all methods required for calculating nCr mod p */

namespace layers * NeuralNetwork class is implements MLP. This class is * used by actual user to create and train networks. * */

* @brief A class to model the geometric distribution */

* \brief Class Complex to represent complex numbers as a field. */

* @brief Represents Bipartite graph for * Hopcroft Karp implementation */

* @brief a class containing the necessary test cases */

* @brief BT used to make the entire structure of the binary tree and the * functions associated with the binary tree */

* @brief A class to perform binary addition of two binary strings. */

* @brief defines the functions associated with the binary tree */

* @brief A Binary Tree class that implements a Binary Search Tree *(BST) by default. */

* @brief Simple bitset implementation for bloom filter */

* @brief A class that implements a Circular Linked List. */

* Class which can be called from main and is globally available * throughout the code */

* Check if a directed graph has a cycle or not. * * This class provides 2 methods to check for cycle in a directed graph: * isCyclicDFS & isCyclicB

* @brief A class that provides methods to separate the digits of a large * positive number. */

* @brief Contains information for Easter date */

* Implementation of non-weighted directed edge of a graph. * * The source vertex of the edge is labelled "src" and destination vertex is * labelled

Wrapper class for storing an edge

* @brief Wrapper class for storing a graph */

* Implementation of graph class. * * The graph will be represented using Adjacency List representation. * This class contains 2 data members "m_ver

* @brief Class for representing graph as an adjacency list. */

* @class Graph * @brief Class that represents a directed graph and provides methods for * manipulating the graph */

* Class for representing a graph as an adjacency list. * Its vertices are indexed 0, 1, ..., N - 1. */

Wrapper class for storing a graph

Wrapper class for storing a graph

* @class Hash * @brief Contains hash array and functions to update it and convert it to a * hexadecimal string */

* @brief Implementation of [Hill * Cipher](https://en.wikipedia.org/wiki/Hill_cipher) algorithm */

* @brief LRU cache class */

* Definition for singly-linked list. */

* @class Longest_Substring * @brief Class that solves the Longest Substring Without Repeating Characters problem. */

* A structure that holds a rooted tree and allow for effecient * queries of the lowest common ancestor of two given vertices in the tree. */

A class for Min Heap */

A Huffman tree node

* @brief defines the structure of a node of the tree */

* @brief The structure to hold Nodes of the tree. * @param data Value that will be stored in the node. * @param left follow up left subtree. * @par

* @brief A Node structure representing a single link Node in a linked list */

* Node structure [Key][Node*, Node*...] */

* A Node class containing a value and pointer to another link */

@brief 2-3-4 tree node class */

* @brief A Node structure representing a single node in BST */

* @brief A Node struct that represents a single Node in a Binary Tree */

* @brief A Node struct that represents a single node in a Binary Tree */

@brief This is a helper structure to do a level order traversal to print * the tree. */

* Structure defining the x and y co-ordinates of the given * point in space */

* @struct Point * @brief for X and Y co-ordinates of the co-ordinate. ******************************************************************************

* Define a Point. */

* @brief Queue_Array class containing the main data and also index of head and * tail of the array. */

* Representation of a rooted tree. For every vertex its parent is * precalculated. */

* intersect returns true if segments of two line intersects and * false if they do not. It calls the subroutines direction * which computes the orie