knapsack_dynamic: Solving the knapsack problem through dynamic programming
In TheodorEmanuelsson/knapsack: What the Package Does (One Line, Title Case)
Description
Usage
Arguments
Value
View source: R/knapsack_dynamic.R
Description
Solving the knapsack problem through dynamic programming
Usage
1
knapsack_dynamic(x, W)
Arguments
x
is a data.frame containing knapsack data. It has two columns: v with values and w with weights.
W
is a numeric scalar which defined the maximum possible weight knapsack can handle before breaking.
Value
a list object containing the best bag value given the weight and the elements that make up the best bag.
TheodorEmanuelsson/knapsack documentation built on Dec. 18, 2021, 4:11 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value
View source: R/knapsack_dynamic.R
Description
Solving the knapsack problem through dynamic programming
Usage
1 | knapsack_dynamic(x, W)
|
Arguments
x |
is a data.frame containing knapsack data. It has two columns: v with values and w with weights. |
W |
is a numeric scalar which defined the maximum possible weight knapsack can handle before breaking. |
Value
a list object containing the best bag value given the weight and the elements that make up the best bag.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.