* @brief Recursive function to calculate the maximum value obtainable using * an unbounded knapsack approach. * * @param i Current index in the value and weight vectors. * @param W Remaining capacity of the knapsack. * @param val Vector of values corresponding to the items. * @note "val" data type can be changed according to the size of the input. * @param wt Vector of weights corres
source not stored for this graph (policy: none)