(self, heap, positions)
| 66 | self.top_to_bottom(heap, i, len(heap), positions) |
| 67 | |
| 68 | def delete_minimum(self, heap, positions): |
| 69 | temp = positions[0] |
| 70 | heap[0] = sys.maxsize |
| 71 | self.top_to_bottom(heap, 0, len(heap), positions) |
| 72 | return temp |
| 73 | |
| 74 | |
| 75 | def prisms_algorithm(adjacency_list): |
no test coverage detected