Namespace MoreStructures.PriorityQueues.BinomialHeap

Classes

BinomialHeapPriorityQueue<T>

An IPriorityQueue<T> implementation based on a Binomial Max Heap of its items. It also supports IMergeablePriorityQueue<T, TPQTarget> operations.

DuplicatedItemsResolution<TItems, THeap>

An object storing and keeping up-to-date the "TItems to TreeNode<T>" back-references, necessary to find back the TreeNode<T> in the heap with highest priority for a given item, without exposing iterators to the client.

TreeNode<T>

A node of a tree, root or non-root, in the underlying forest representing the heap.

UpdatableBinomialHeapPriorityQueue<T>

A refinement of BinomialHeapPriorityQueue<T> which supports IUpdatablePriorityQueue<T> operations, such as retrieval and update of priorities and removal of items.