Python Soft Heap Implementation
Soft Heap in Python
This library is a full python implementation of Bernard Chazelle's soft heap .
The soft heap is a heap-like data structure which gives all heap operations a constant runtime, with the exception of insert. However, in order to maintain this seemingly impossible runtime, some of the data is "corrupted". The result of this is that insert takes O(log 1/e) where e is the rate of corruption.
To get started, import the module. We'll also import random for this example.
from softheap import * import random
The soft heap requires one input, the error rate r. The number of corrupted nodes in the heap is inversely proportional to r.
s = SoftHeap(2)
We can test the heap by randomly inserting 100 elements into the heap.
arr = list(range(100)) random.shuffle(arr) for a in arr: s.insert(a)
Now when we deletemin repeatedly, the output will be approximately sorted.
output =  for b in range(len(arr)) output.append(s.deletemin()) print(output)
This takes O(n log 1/e) time.
Use pip to install softheap. Via the command line:
pip install softheap
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size softheap-0.2-py2-none-any.whl (3.8 kB)||File type Wheel||Python version py2||Upload date||Hashes View hashes|
|Filename, size softheap-0.2.tar.gz (3.5 kB)||File type Source||Python version None||Upload date||Hashes View hashes|