(self, node, new_value)
| 124 | return len(self.heap) == 0 |
| 125 | |
| 126 | def decrease_key(self, node, new_value): |
| 127 | assert self.heap[self.idx_of_element[node]].val > new_value, ( |
| 128 | "newValue must be less that current value" |
| 129 | ) |
| 130 | node.val = new_value |
| 131 | self.heap_dict[node.name] = new_value |
| 132 | self.sift_up(self.idx_of_element[node]) |
| 133 | |
| 134 | |
| 135 | # USAGE |