MinimumHeap

In Kone, minimum heap is a structure that consists of:

1. an order on values called "priorities" (thus, heap is contextful)

2. and a tree (in computer science sense of the word) that holds one priority value and one "element" value in each its vertex and satisfies heap property: for any given vertex \(C\), if \(P\) is the parent vertex of \(C\), then the priority of \(P\) is less than or equal to the priority of \(C\).

This interface's inheritors must have some specific structure that provides optimised minimum node access. Without it (or with bad time complexity like \(O(n)\)) the interface should not be used.

Inheritors