Show / Hide Table of Contents

    Namespace Advanced.Algorithms.DataStructures

    Classes

    AVLTree<T>

    An AVL tree implementation.

    BinaryTree<T>

    A binary tree implementation using pointers.

    BinomialMaxHeap<T>

    A binomial max heap implementation.

    BinomialMinHeap<T>

    A binomial min heap implementation.

    BloomFilter<T>

    A simple bloom filter implementation.

    BMaxHeap<T>

    A binary max heap implementation.

    BMinHeap<T>

    A binary min heap implementation.

    BpTree<T>

    A B+ tree implementation.

    BST<T>

    A binary search tree implementation.

    BTree<T>

    A B-tree implementation.

    CircularLinkedList<T>

    A circular linked list implementation.

    CircularLinkedListNode<T>

    Circular linked list node.

    DaryMaxHeap<T>

    A D-ary max heap implementation.

    DaryMinHeap<T>

    A D-ary min heap implementation.

    DisJointSet<T>

    A disjoint set implementation.

    DoublyLinkedList<T>

    A doubly linked list implementation.

    DoublyLinkedListNode<T>

    Doubly linked list node.

    FenwickTree<T>

    A Fenwick Tree (binary indexed tree) implementation for prefix sum.

    FibornacciMaxHeap<T>

    A fibornacci max heap implementation.

    FibornacciMinHeap<T>

    A fibornacci min heap implementation.

    IntervalTree<T>

    A multi-dimensional interval tree implementation.

    KDTree<T>

    A multiDimensional k-d tree implementation (Unbalanced).

    MaxPriorityQueue<T>

    A priority queue implementation using min heap, assuming that higher values have a higher priority.

    MinPriorityQueue<T>

    A priority queue implementation using min heap, assuming that lower values have a higher priority.

    PairingMaxHeap<T>

    A pairing max heap implementation.

    PairingMinHeap<T>

    A pairing min heap implementation.

    QuadTree<T>

    A quadtree implementation.

    RangeTree<T>

    A multi-dimentional range tree implementation.

    RedBlackTree<T>

    A red black tree implementation.

    RTree

    An RTree implementation.

    SegmentTree<T>

    A segment tree implementation.

    SinglyLinkedList<T>

    A singly linked list implementation.

    SinglyLinkedListNode<T>

    Singly linked list node.

    SkipList<T>

    A skip list implementation with IEnumerable support.

    SparseSet

    A sparse set implementation.

    SplayTree<T>

    A splay tree implementation.

    SuffixTree<T>

    A suffix tree implementation using a trie.

    TernarySearchTree<T>

    A ternary search tree implementation.

    TreapTree<T>

    A treap tree implementation.

    Tree<T>

    A tree implementation.

    Trie<T>

    A trie (prefix tree) implementation.

    Interfaces

    IDistanceCalculator<T>

    A concrete implementation of this interface is required when calling NearestNeigbour() for k-d tree.

    Back to top Generated by DocFX