Accord.Collections Namespace

Tree node for binary trees.

Base class for binary trees. This class does not implement a binary search tree, but can used to implement one. For binary search trees, please refer to RedBlackTreeT, KDTree and VPTree.

Convenience class for k-dimensional tree static methods. To create a new KDTree, specify the generic parameter as in KDTreeT.

K-dimensional tree.

Base class for K-dimensional trees.

K-dimensional tree node (for KDTree).

K-dimensional tree node (for KDTreeT).

Base class for K-dimensional tree nodes.

Collection of k-dimensional tree nodes.

List of k-dimensional tree nodes.

Vanilla key-based comparer for KeyValuePairTKey, TValue.

Ordered dictionary.

Priority queue.

Read-only keyed collection wrapper.

Red-black tree.

Red-black tree specialized for key-based value retrieval.

Sorted dictionary based on a red-black tree.

RedBlackTreeT node.

RedBlackTreeT node.

Region of space in a Space-Partitioning Tree. Represents an axis-aligned bounding box stored as a center with half-dimensions to represent the boundaries of this quad tree.

Space-Partitioning Tree.

Node for a Space-Partitioning Tree.

Base class for tree structures.

Tree node with arbitrary number of children.

Static class with tree traversal methods.

Two-way dictionary for efficient lookups by both key and value. This can be used to represent a one-to-one relation among two object types.

Vantage-Point Tree.

Vantage-Point Tree.

Vantage-Point Tree.

Base class for Vantage-Point Trees.

Node of a VPTree.

Node of a VPTree.

Base class for VPTree nodes.

Node-distance pair.

Represents the node of a priority queue.

Common interface for tree nodes, such as BinaryTreeTNode and TreeNodeTNode.

Tree enumeration method delegate.

Tree enumeration method delegate.

Priority order for PriorityQueueT.

Possible node colors for RedBlackTreeTs.