|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Result of divide-and-conquer partition DP optimization. More...
#include <DP_Optimizations.H>
Public Attributes | |
| Cost | optimal_cost = Cost{} |
| Final optimum at state (groups, n). | |
| Array< Cost > | last_row |
| Last DP layer (size n+1). | |
| Array< Array< size_t > > | split |
| Best split index per layer/state. | |
Result of divide-and-conquer partition DP optimization.
| Cost | Numeric DP cost type. |
Definition at line 105 of file DP_Optimizations.H.
| Array<Cost> Aleph::Divide_Conquer_DP_Result< Cost >::last_row |
Last DP layer (size n+1).
Definition at line 108 of file DP_Optimizations.H.
| Cost Aleph::Divide_Conquer_DP_Result< Cost >::optimal_cost = Cost{} |
Final optimum at state (groups, n).
Definition at line 107 of file DP_Optimizations.H.
| Array<Array<size_t> > Aleph::Divide_Conquer_DP_Result< Cost >::split |
Best split index per layer/state.
Definition at line 109 of file DP_Optimizations.H.