IMP
2.2.0
The Integrative Modeling Platform
|
The heapq algorithm is a min-heap. More...
Inherits tuple.
I want a max-heap, that pops the larger values out of the heap. For that I have to modify the comparison function and also set the index that is used for the comparison. The index corresponds to the restraint that we desired to order by
Definition at line 61 of file solutions_io.py.