🔍 test: Increase coverage.

Author: make-github-pseudonymous-again

src/integerValuesKnapsackUnbounded.js

@@ -10,6 +10,7 @@ import {max, map, range} from '@aureooms/js-itertools';
  * @param {Array} w Weights.
  * @param {Number} n Size of the problem.
  * @param {Number} W Size of the knapsack.
+ * @param {Number|BigInt} zero The number 0.
  * @param {Number} V Any upper bound on OPT >= 0.
  * @param {Array} m Memory buffer.
  */
@@ -18,11 +19,13 @@ const integerValuesKnapsackUnbounded = (
 	w,
 	n,
 	W,
+	zero = 0,
 	V = Math.floor(
 		W *
 			max(
 				increasing,
 				map((i) => v[i] / w[i], range(n)),
+				zero,
 			),
 	),
 	m = new w.constructor(V + 1).fill(W + 1),

test/src/0-1-knapsack-problem.js

@@ -39,6 +39,7 @@ const approx = (ratio) => {
 		solve,
 		name,
 		approx: ratio,
+		hypothesis: (_v, _w, n) => n > 0,
 	};
 };
 
@@ -57,6 +58,14 @@ const solvers = [
 ];
 
 const instances = [
+	{
+		title: 'empty instance',
+		v: [],
+		w: [],
+		n: 0,
+		W: 15,
+		opt: 0,
+	},
 	{
 		title: 'wikipedia illustration',
 		v: [4, 2, 2, 1, 10],

test/src/unbounded-knapsack-problem.js

@@ -46,6 +46,14 @@ const solvers = [
 ];
 
 const instances = [
+	{
+		title: 'empty instance',
+		v: [],
+		w: [],
+		n: 0,
+		W: 15,
+		opt: 0,
+	},
 	{
 		title: 'wikipedia illustration',
 		v: [4, 2, 2, 1, 10],