Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class KnapsackState
Note: This documentation is automatically generated.
----- KnapsackState -----
KnapsackState represents a partial solution to the knapsack problem.
| Method |
GetNumberOfItems | Return type: int |
Init | Return type: void Arguments: int number_of_items Initializes vectors with number_of_items set to false (i.e. not bound yet).
|
is_bound | Return type: bool Arguments: int id |
is_in | Return type: bool Arguments: int id |
KnapsackState | |
UpdateState | Return type: bool Arguments: bool revert, const KnapsackAssignment& assignment Updates the state by applying or reverting a decision.
Returns false if fails, i.e. trying to apply an inconsistent decision
to an already assigned item.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["`KnapsackState` represents a partial solution to the knapsack problem. Key actions include: `Init` initializes item vectors as unbound. `GetNumberOfItems` retrieves the item count. `is_bound` and `is_in` check item status. `UpdateState` applies or reverts decisions via a `KnapsackAssignment`, returning `false` if a decision is inconsistent with existing assignments. There's also a constructor `KnapsackState` available.\n"],null,[]]
