This repository has been archived by the owner on Aug 29, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
5430b3f
commit 30e1267
Showing
9 changed files
with
8,679 additions
and
68 deletions.
There are no files selected for viewing
Large diffs are not rendered by default.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,56 @@ | ||
| class Heap(object): | ||
| """" | ||
| Attributes: | ||
| heap: List representation of the heap | ||
| compar(p, c): comparator function, returns true if the relation between p and c is parent-chield | ||
| """ | ||
| def __init__(self, compar): | ||
| self.heap = [] | ||
| self.compar = compar | ||
|
|
||
| def is_empty(self): | ||
| return len(self.heap) == 0 | ||
|
|
||
| def _inv_heapify(self, element_id): | ||
| """ | ||
| Do heapifying starting from bottom till it reaches the root. | ||
| """ | ||
| while element_id > 0: | ||
| if self.compar(self.heap[element_id // 2], self.heap[element_id]): | ||
| return | ||
| self.heap[element_id // 2], self.heap[element_id] = self.heap[element_id], self.heap[element_id // 2] | ||
| element_id //=2 | ||
|
|
||
| def _heapify(self, element_id): | ||
| """ | ||
| Do heepifying starting from the root. | ||
| """ | ||
| l = len(self.heap) | ||
| if l == 1: | ||
| return | ||
| while 2 * element_id < l: | ||
| el_id = 2 * element_id | ||
| if 2 * element_id + 1 < l and self.compar(self.heap[element_id * 2 + 1], self.heap[element_id * 2]): | ||
| el_id += 1 | ||
| if self.compar(self.heap[element_id], self.heap[el_id]): | ||
| return | ||
| self.heap[element_id], self.heap[el_id] = self.heap[el_id], self.heap[element_id] | ||
| element_id = el_id | ||
|
|
||
| def del_min(self): | ||
| if self.is_empty(): | ||
| return None | ||
| x = self.heap.pop(0) | ||
| if not self.is_empty(): | ||
| self.heap = [self.heap[-1]] + self.heap[0:-1] | ||
| self._heapify (0) | ||
| return x | ||
|
|
||
| def min(self): | ||
| if self.is_empty(): | ||
| return None | ||
| return self.heap[0] | ||
|
|
||
| def add(self, element): | ||
| self.heap.append(element) | ||
| self._inv_heapify (len (self.heap) - 1) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.