Detailed Description

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

Note: This class is only available in Python.

Definition at line 14 of file solutions_io.py.

The documentation for this class was generated from the following file:

solutions_io.py