paal::detail::Knapsack_0_1_get_position_range Struct Reference

For 0/1 knapsack dynamic algorithm for given element the table has to be traversed from the highest to the lowest element. More...

#include <knapsack_0_1.hpp>

Public Member Functions
template<typename T >
auto	operator() (T begin, T end) -> decltype(irange(begin, end)|boost::adaptors::reversed)

Detailed Description

For 0/1 knapsack dynamic algorithm for given element the table has to be traversed from the highest to the lowest element.

Definition at line 40 of file knapsack_0_1.hpp.

---

The documentation for this struct was generated from the following file:

• include/paal/dynamic/knapsack_0_1.hpp