Stay organized with collections Save and categorize content based on your preferences.

C++ Reference: class KnapsackSearchPath

Note: This documentation is automatically generated.

   ----- KnapsackSearchPath -----
KnapsackSearchPath is a small class used to represent the path between a node to another node in the search tree. As the solution state is not stored for each search node, the state should be rebuilt at each node. One simple solution is to apply all decisions between the node 'to' and the root. This can be computed in O(number_of_items).

However, it is possible to achieve better average complexity. Two consecutively explored nodes are usually close enough (i.e., much less than number_of_items) to benefit from an incremental update from the node 'from' to the node 'to'.

The 'via' field is the common parent of 'from' field and 'to' field. So the state can be built by reverting all decisions from 'from' to 'via' and then applying all decisions from 'via' to 'to'.

Return type: const KnapsackSearchNode&


Return type: void


Arguments: const KnapsackSearchNode& from, const KnapsackSearchNode& to


Return type: const KnapsackSearchNode*

Arguments: const KnapsackSearchNode& node, int depth


Return type: const KnapsackSearchNode&


Return type: const KnapsackSearchNode&