interactive-coding-challenges/recursion_dynamic/knapsack_01/test_knapsack.py

47 lines
1.7 KiB
Python
Raw Normal View History

2017-03-28 17:06:47 +08:00
from nose.tools import assert_equal, assert_raises
class TestKnapsack(object):
def test_knapsack_bottom_up(self):
knapsack = Knapsack()
assert_raises(TypeError, knapsack.fill_knapsack, None, None)
assert_equal(knapsack.fill_knapsack(0, 0), 0)
items = []
items.append(Item(label='a', value=2, weight=2))
items.append(Item(label='b', value=4, weight=2))
items.append(Item(label='c', value=6, weight=4))
items.append(Item(label='d', value=9, weight=5))
total_weight = 8
expected_value = 13
results = knapsack.fill_knapsack(items, total_weight)
assert_equal(results[0].label, 'd')
assert_equal(results[1].label, 'b')
total_value = 0
for item in results:
total_value += item.value
assert_equal(total_value, expected_value)
print('Success: test_knapsack_bottom_up')
def test_knapsack_top_down(self):
knapsack = KnapsackTopDown()
assert_raises(TypeError, knapsack.fill_knapsack, None, None)
assert_equal(knapsack.fill_knapsack(0, 0), 0)
items = []
items.append(Item(label='a', value=2, weight=2))
items.append(Item(label='b', value=4, weight=2))
items.append(Item(label='c', value=6, weight=4))
items.append(Item(label='d', value=9, weight=5))
total_weight = 8
expected_value = 13
assert_equal(knapsack.fill_knapsack(items, total_weight), expected_value)
print('Success: test_knapsack_top_down')
def main():
test = TestKnapsack()
test.test_knapsack_bottom_up()
test.test_knapsack_top_down()
if __name__ == '__main__':
main()