|
1 |
| -using System; |
2 |
| -using System.Linq; |
3 |
| -using Algorithms.Knapsack; |
4 |
| -using NUnit.Framework; |
5 |
| - |
6 |
| -namespace Algorithms.Tests.Knapsack |
7 |
| -{ |
8 |
| - public static class DynamicProgrammingKnapsackSolverTests |
9 |
| - { |
10 |
| - [Test] |
11 |
| - public static void SmallSampleOfChar() |
12 |
| - { |
13 |
| - //Arrange |
14 |
| - var items = new[] { 'A', 'B', 'C' }; |
15 |
| - var val = new[] { 50, 100, 130 }; |
16 |
| - var wt = new[] { 10, 20, 40 }; |
17 |
| - |
18 |
| - var capacity = 50; |
19 |
| - |
20 |
| - Func<char, int> weightSelector = x => wt[Array.IndexOf(items, x)]; |
21 |
| - Func<char, double> valueSelector = x => val[Array.IndexOf(items, x)]; |
22 |
| - |
23 |
| - var expected = new[] { 'A', 'C' }; |
24 |
| - |
25 |
| - |
26 |
| - //Act |
27 |
| - var solver = new DynamicProgrammingKnapsackSolver<char>(); |
28 |
| - var actual = solver.Solve(items, capacity, weightSelector, valueSelector); |
29 |
| - |
30 |
| - //Assert |
31 |
| - Assert.AreEqual(expected.OrderBy(x => x), actual.OrderBy(x => x)); |
32 |
| - } |
33 |
| - |
34 |
| - [Test] |
35 |
| - public static void FSU_P01() |
36 |
| - { |
37 |
| - // Data from https://people.sc.fsu.edu/~jburkardt/datasets/knapsack_01/knapsack_01.html |
38 |
| - |
39 |
| - //Arrange |
40 |
| - var items = new[] { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J' }; |
41 |
| - var val = new[] { 92, 57, 49, 68, 60, 43, 67, 84, 87, 72 }; |
42 |
| - var wt = new[] { 23, 31, 29, 44, 53, 38, 63, 85, 89, 82 }; |
43 |
| - |
44 |
| - var capacity = 165; |
45 |
| - |
46 |
| - Func<char, int> weightSelector = x => wt[Array.IndexOf(items, x)]; |
47 |
| - Func<char, double> valueSelector = x => val[Array.IndexOf(items, x)]; |
48 |
| - |
49 |
| - var expected = new[] { 'A', 'B', 'C', 'D', 'F' }; |
50 |
| - |
51 |
| - //Act |
52 |
| - var solver = new DynamicProgrammingKnapsackSolver<char>(); |
53 |
| - var actual = solver.Solve(items, capacity, weightSelector, valueSelector); |
54 |
| - |
55 |
| - //Assert |
56 |
| - Assert.AreEqual(expected.OrderBy(x => x), actual.OrderBy(x => x)); |
57 |
| - } |
58 |
| - |
59 |
| - [Test] |
60 |
| - public static void FSU_P07_WithNonIntegralValues() |
61 |
| - { |
62 |
| - // Shows how to handle weights with 1 significant digit right of the decimal |
63 |
| - // Data from https://people.sc.fsu.edu/~jburkardt/datasets/knapsack_01/knapsack_01.html |
64 |
| - |
65 |
| - //Arrange |
66 |
| - var val = new[] { 135, 139, 149, 150, 156, 163, 173, 184, 192, 201, 210, 214, 221, 229, 240 }; |
67 |
| - var wt = new[] { 7.0, 7.3, 7.7, 8.0, 8.2, 8.7, 9.0, 9.4, 9.8, 10.6, 11.0, 11.3, 11.5, 11.8, 12.0 }; |
68 |
| - var items = Enumerable.Range(1, val.Count()).ToArray(); |
69 |
| - |
70 |
| - var capacity = 75; |
71 |
| - |
72 |
| - Func<int, int> weightSelector = x => (int)(wt[Array.IndexOf(items, x)] * 10); |
73 |
| - Func<int, double> valueSelector = x => val[Array.IndexOf(items, x)]; |
74 |
| - |
75 |
| - var expected = new[] { 1, 3, 5, 7, 8, 9, 14, 15 }; |
76 |
| - |
77 |
| - |
78 |
| - //Act |
79 |
| - var solver = new DynamicProgrammingKnapsackSolver<int>(); |
80 |
| - var actual = solver.Solve(items, capacity * 10, weightSelector, valueSelector); |
81 |
| - |
82 |
| - //Assert |
83 |
| - Assert.AreEqual(expected.OrderBy(x => x), actual.OrderBy(x => x)); |
84 |
| - } |
85 |
| - |
86 |
| - |
87 |
| - [Test] |
88 |
| - public static void TakesHalf([Random(0, 1000, 100, Distinct = true)]int length) |
89 |
| - { |
90 |
| - //Arrange |
91 |
| - var solver = new DynamicProgrammingKnapsackSolver<int>(); |
92 |
| - var items = Enumerable.Repeat(42, 2 * length).ToArray(); |
93 |
| - var expectedResult = Enumerable.Repeat(42, length); |
94 |
| - |
95 |
| - //Act |
96 |
| - var result = solver.Solve(items, length, x => 1, y => 1); |
97 |
| - |
98 |
| - //Assert |
99 |
| - Assert.AreEqual(expectedResult, result); |
100 |
| - } |
101 |
| - } |
102 |
| -} |
| 1 | +using System; |
| 2 | +using System.Linq; |
| 3 | +using Algorithms.Knapsack; |
| 4 | +using NUnit.Framework; |
| 5 | + |
| 6 | +namespace Algorithms.Tests.Knapsack |
| 7 | +{ |
| 8 | + public static class DynamicProgrammingKnapsackSolverTests |
| 9 | + { |
| 10 | + [Test] |
| 11 | + public static void SmallSampleOfChar() |
| 12 | + { |
| 13 | + //Arrange |
| 14 | + var items = new[] { 'A', 'B', 'C' }; |
| 15 | + var val = new[] { 50, 100, 130 }; |
| 16 | + var wt = new[] { 10, 20, 40 }; |
| 17 | + |
| 18 | + var capacity = 50; |
| 19 | + |
| 20 | + Func<char, int> weightSelector = x => wt[Array.IndexOf(items, x)]; |
| 21 | + Func<char, double> valueSelector = x => val[Array.IndexOf(items, x)]; |
| 22 | + |
| 23 | + var expected = new[] { 'A', 'C' }; |
| 24 | + |
| 25 | + |
| 26 | + //Act |
| 27 | + var solver = new DynamicProgrammingKnapsackSolver<char>(); |
| 28 | + var actual = solver.Solve(items, capacity, weightSelector, valueSelector); |
| 29 | + |
| 30 | + //Assert |
| 31 | + Assert.AreEqual(expected.OrderBy(x => x), actual.OrderBy(x => x)); |
| 32 | + } |
| 33 | + |
| 34 | + [Test] |
| 35 | + public static void FSU_P01() |
| 36 | + { |
| 37 | + // Data from https://people.sc.fsu.edu/~jburkardt/datasets/knapsack_01/knapsack_01.html |
| 38 | + |
| 39 | + //Arrange |
| 40 | + var items = new[] { 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J' }; |
| 41 | + var val = new[] { 92, 57, 49, 68, 60, 43, 67, 84, 87, 72 }; |
| 42 | + var wt = new[] { 23, 31, 29, 44, 53, 38, 63, 85, 89, 82 }; |
| 43 | + |
| 44 | + var capacity = 165; |
| 45 | + |
| 46 | + Func<char, int> weightSelector = x => wt[Array.IndexOf(items, x)]; |
| 47 | + Func<char, double> valueSelector = x => val[Array.IndexOf(items, x)]; |
| 48 | + |
| 49 | + var expected = new[] { 'A', 'B', 'C', 'D', 'F' }; |
| 50 | + |
| 51 | + //Act |
| 52 | + var solver = new DynamicProgrammingKnapsackSolver<char>(); |
| 53 | + var actual = solver.Solve(items, capacity, weightSelector, valueSelector); |
| 54 | + |
| 55 | + //Assert |
| 56 | + Assert.AreEqual(expected.OrderBy(x => x), actual.OrderBy(x => x)); |
| 57 | + } |
| 58 | + |
| 59 | + [Test] |
| 60 | + public static void FSU_P07_WithNonIntegralValues() |
| 61 | + { |
| 62 | + // Shows how to handle weights with 1 significant digit right of the decimal |
| 63 | + // Data from https://people.sc.fsu.edu/~jburkardt/datasets/knapsack_01/knapsack_01.html |
| 64 | + |
| 65 | + //Arrange |
| 66 | + var val = new[] { 135, 139, 149, 150, 156, 163, 173, 184, 192, 201, 210, 214, 221, 229, 240 }; |
| 67 | + var wt = new[] { 7.0, 7.3, 7.7, 8.0, 8.2, 8.7, 9.0, 9.4, 9.8, 10.6, 11.0, 11.3, 11.5, 11.8, 12.0 }; |
| 68 | + var items = Enumerable.Range(1, val.Count()).ToArray(); |
| 69 | + |
| 70 | + var capacity = 75; |
| 71 | + |
| 72 | + Func<int, int> weightSelector = x => (int)(wt[Array.IndexOf(items, x)] * 10); |
| 73 | + Func<int, double> valueSelector = x => val[Array.IndexOf(items, x)]; |
| 74 | + |
| 75 | + var expected = new[] { 1, 3, 5, 7, 8, 9, 14, 15 }; |
| 76 | + |
| 77 | + |
| 78 | + //Act |
| 79 | + var solver = new DynamicProgrammingKnapsackSolver<int>(); |
| 80 | + var actual = solver.Solve(items, capacity * 10, weightSelector, valueSelector); |
| 81 | + |
| 82 | + //Assert |
| 83 | + Assert.AreEqual(expected.OrderBy(x => x), actual.OrderBy(x => x)); |
| 84 | + } |
| 85 | + |
| 86 | + |
| 87 | + [Test] |
| 88 | + public static void TakesHalf([Random(0, 1000, 100, Distinct = true)]int length) |
| 89 | + { |
| 90 | + //Arrange |
| 91 | + var solver = new DynamicProgrammingKnapsackSolver<int>(); |
| 92 | + var items = Enumerable.Repeat(42, 2 * length).ToArray(); |
| 93 | + var expectedResult = Enumerable.Repeat(42, length); |
| 94 | + |
| 95 | + //Act |
| 96 | + var result = solver.Solve(items, length, x => 1, y => 1); |
| 97 | + |
| 98 | + //Assert |
| 99 | + Assert.AreEqual(expectedResult, result); |
| 100 | + } |
| 101 | + } |
| 102 | +} |
0 commit comments