Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <arc_flow_builder.h>
Classes | |
struct | Arc |
Public Attributes | |
std::vector< Arc > | arcs |
std::vector< std::vector< int > > | nodes |
int64_t | num_dp_states |
Debug info. | |
Arc flow gragh built from a vector bin packing problem. The first node will always be the source. The last will always be the sink of the arc-flow graph.
Definition at line 57 of file arc_flow_builder.h.
std::vector<Arc> operations_research::packing::ArcFlowGraph::arcs |
Definition at line 67 of file arc_flow_builder.h.
std::vector<std::vector<int> > operations_research::packing::ArcFlowGraph::nodes |
All the nodes explored during the DP phase. In the forward pass, these are the consumed capacity of the bin at this state. In the backward pass, this is pushed up towards the max capacity of the bin. In the final compression phase, this is pushed down towards the initial zero state.
Definition at line 73 of file arc_flow_builder.h.
int64_t operations_research::packing::ArcFlowGraph::num_dp_states |
Debug info.
Definition at line 75 of file arc_flow_builder.h.