Namespace Advanced.Algorithms.DataStructures

Classes

AvlTree<T>

An AVL tree implementation.

BHeap<T>

A binary heap implementation.

BinaryTree<T>

A binary tree implementation using pointers.

BinomialHeap<T>

A binomial minMax heap implementation.

BloomFilter<T>

A simple bloom filter 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.

DaryHeap<T>

A D-ary minMax 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.

FibonacciHeap<T>

A fibornacci minMax heap implementation.

IntervalTree<T>

A multi-dimensional interval tree implementation.

KdTree<T>

A multiDimensional k-d tree implementation (Unbalanced).

PairingHeap<T>

A pairing minMax heap implementation.

PriorityQueue<T>

A priority queue implementation using heap

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.