4961b3aa89
* enhance knapsack problem * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * wei/refactor code * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update test_knapsack.py * Update knapsack.py * Update test_knapsack.py * Update knapsack.py * Update knapsack.py * Update knapsack.py * Update knapsack.py * Update knapsack.py * Update test_knapsack.py --------- Co-authored-by: weijiang <weijiang@weijiangs-MacBook-Pro.local> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
64 lines
1.3 KiB
Python
64 lines
1.3 KiB
Python
"""
|
|
Created on Fri Oct 16 09:31:07 2020
|
|
|
|
@author: Dr. Tobias Schröder
|
|
@license: MIT-license
|
|
|
|
This file contains the test-suite for the knapsack problem.
|
|
"""
|
|
|
|
import unittest
|
|
|
|
from knapsack import knapsack as k
|
|
|
|
|
|
class Test(unittest.TestCase):
|
|
def test_base_case(self):
|
|
"""
|
|
test for the base case
|
|
"""
|
|
cap = 0
|
|
val = [0]
|
|
w = [0]
|
|
c = len(val)
|
|
assert k.knapsack(cap, w, val, c) == 0
|
|
|
|
val = [60]
|
|
w = [10]
|
|
c = len(val)
|
|
assert k.knapsack(cap, w, val, c) == 0
|
|
|
|
def test_easy_case(self):
|
|
"""
|
|
test for the easy case
|
|
"""
|
|
cap = 3
|
|
val = [1, 2, 3]
|
|
w = [3, 2, 1]
|
|
c = len(val)
|
|
assert k.knapsack(cap, w, val, c) == 5
|
|
|
|
def test_knapsack(self):
|
|
"""
|
|
test for the knapsack
|
|
"""
|
|
cap = 50
|
|
val = [60, 100, 120]
|
|
w = [10, 20, 30]
|
|
c = len(val)
|
|
assert k.knapsack(cap, w, val, c) == 220
|
|
|
|
def test_knapsack_repetition(self):
|
|
"""
|
|
test for the knapsack repetition
|
|
"""
|
|
cap = 50
|
|
val = [60, 100, 120]
|
|
w = [10, 20, 30]
|
|
c = len(val)
|
|
assert k.knapsack(cap, w, val, c, True) == 300
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|