def test_extract_min(self): q = min_priority_queue([41, 38, 31, 12, 19, 9]) self.assertEqual(q.heap_extract_min().key, 9) self.assertEqual(q.heap_extract_min().key, 12) self.assertEqual(q.heap_extract_min().key, 19) self.assertEqual(q.heap_extract_min().key, 31) self.assertEqual(q.heap_extract_min().key, 38) self.assertEqual(q.heap_extract_min().key, 41)
def test_extract_min(self): q = min_priority_queue([41, 38, 31, 12, 19, 9]) self.assertEquals(q.heap_extract_min().key, 9) self.assertEquals(q.heap_extract_min().key, 12) self.assertEquals(q.heap_extract_min().key, 19) self.assertEquals(q.heap_extract_min().key, 31) self.assertEquals(q.heap_extract_min().key, 38) self.assertEquals(q.heap_extract_min().key, 41)
def test_heap_decrease_key(self): q = min_priority_queue([41, 38, 31, 12, 19, 9]) q.heap_decrease_key(q.iterative_tree_search(9), 5) q.heap_decrease_key(q.iterative_tree_search(38), 5) self.assertEqual(q.heap_extract_min().key, 5) self.assertEqual(q.heap_extract_min().key, 5) self.assertEqual(q.heap_extract_min().key, 12) self.assertEqual(q.heap_extract_min().key, 19) self.assertEqual(q.heap_extract_min().key, 31) self.assertEqual(q.heap_extract_min().key, 41)
def test_heap_decrease_key(self): q = min_priority_queue([41, 38, 31, 12, 19, 9]) q.heap_decrease_key(q.iterative_tree_search(9), 5) q.heap_decrease_key(q.iterative_tree_search(38), 5) self.assertEquals(q.heap_extract_min().key, 5) self.assertEquals(q.heap_extract_min().key, 5) self.assertEquals(q.heap_extract_min().key, 12) self.assertEquals(q.heap_extract_min().key, 19) self.assertEquals(q.heap_extract_min().key, 31) self.assertEquals(q.heap_extract_min().key, 41)
def test_heap_insert(self): q = min_priority_queue([41, 38, 31, 12, 19, 9]) q.min_heap_insert(rb_node(5, None, None, None, 0)) q.min_heap_insert(rb_node(38, None, None, None, 0)) q.min_heap_insert(rb_node(50, None, None, None, 0)) self.assertEqual(q.heap_extract_min().key, 5) self.assertEqual(q.heap_extract_min().key, 9) self.assertEqual(q.heap_extract_min().key, 12) self.assertEqual(q.heap_extract_min().key, 19) self.assertEqual(q.heap_extract_min().key, 31) self.assertEqual(q.heap_extract_min().key, 38) self.assertEqual(q.heap_extract_min().key, 38) self.assertEqual(q.heap_extract_min().key, 41) self.assertEqual(q.heap_extract_min().key, 50)
def test_heap_insert(self): q = min_priority_queue([41, 38, 31, 12, 19, 9]) q.min_heap_insert(rb_node(5, None, None, None, 0)) q.min_heap_insert(rb_node(38, None, None, None, 0)) q.min_heap_insert(rb_node(50, None, None, None, 0)) self.assertEquals(q.heap_extract_min().key, 5) self.assertEquals(q.heap_extract_min().key, 9) self.assertEquals(q.heap_extract_min().key, 12) self.assertEquals(q.heap_extract_min().key, 19) self.assertEquals(q.heap_extract_min().key, 31) self.assertEquals(q.heap_extract_min().key, 38) self.assertEquals(q.heap_extract_min().key, 38) self.assertEquals(q.heap_extract_min().key, 41) self.assertEquals(q.heap_extract_min().key, 50)