A bounded min heap that stores floats. The top element is the lowest value of the heap.
A primitive priority queue that maintains a partial ordering of its elements such that the least element can always be found in constant time. Implementation is based on [ ]