Inserts a node into the Priority Queue. Examples: >>> priority_queue_test = PriorityQueue() >>> priority_queue_test.insert((10, 'A')) >>> priority_queue_test.array [(10, 'A')] >>> priority_queue_test.insert((15, 'B')) >>> priority_que
(self, tup)
| 85 | self.min_heapify(smallest) |
| 86 | |
| 87 | def insert(self, tup): |
| 88 | """ |
| 89 | Inserts a node into the Priority Queue. |
| 90 | |
| 91 | Examples: |
| 92 | >>> priority_queue_test = PriorityQueue() |
| 93 | >>> priority_queue_test.insert((10, 'A')) |
| 94 | >>> priority_queue_test.array |
| 95 | [(10, 'A')] |
| 96 | >>> priority_queue_test.insert((15, 'B')) |
| 97 | >>> priority_queue_test.array |
| 98 | [(10, 'A'), (15, 'B')] |
| 99 | >>> priority_queue_test.insert((5, 'C')) |
| 100 | >>> priority_queue_test.array |
| 101 | [(5, 'C'), (10, 'A'), (15, 'B')] |
| 102 | """ |
| 103 | self.pos[tup[1]] = self.cur_size |
| 104 | self.cur_size += 1 |
| 105 | self.array.append((sys.maxsize, tup[1])) |
| 106 | self.decrease_key((sys.maxsize, tup[1]), tup[0]) |
| 107 | |
| 108 | def extract_min(self): |
| 109 | """ |
no test coverage detected