Limbo
|
Network simplex algorithm for min-cost flow. More...
#include <DualMinCostFlow.h>
Public Types | |
typedef T | value_type |
value type | |
typedef MinCostFlowSolver< T, V > | base_type |
base type | |
typedef base_type::dualsolver_type | dualsolver_type |
dual min-cost flow solver type | |
typedef lemon::NetworkSimplex < typename dualsolver_type::graph_type, value_type, value_type > | alg_type |
algorithm type | |
typedef T | value_type |
value type | |
typedef MinCostFlowSolver< T, V > | base_type |
base type | |
typedef base_type::primalsolver_type | primalsolver_type |
dual min-cost flow solver type | |
typedef lemon::NetworkSimplex < typename primalsolver_type::graph_type, value_type, value_type > | alg_type |
algorithm type | |
![]() | |
typedef DualMinCostFlow< T, V > | dualsolver_type |
dual min-cost flow solver type | |
typedef MinCostFlow< T, V > | primalsolver_type |
dual min-cost flow solver type | |
Public Member Functions | |
NetworkSimplex (typename alg_type::PivotRule pivotRule=alg_type::BLOCK_SEARCH) | |
constructor More... | |
NetworkSimplex (NetworkSimplex const &rhs) | |
copy constructor More... | |
NetworkSimplex & | operator= (NetworkSimplex const &rhs) |
assignment More... | |
virtual SolverProperty | operator() (dualsolver_type *d) |
API to run min-cost flow solver. More... | |
NetworkSimplex (typename alg_type::PivotRule pivotRule=alg_type::BLOCK_SEARCH) | |
constructor More... | |
NetworkSimplex (NetworkSimplex const &rhs) | |
copy constructor More... | |
NetworkSimplex & | operator= (NetworkSimplex const &rhs) |
assignment More... | |
virtual SolverProperty | operator() (primalsolver_type *d) |
API to run min-cost flow solver. More... | |
![]() | |
MinCostFlowSolver () | |
constructor | |
MinCostFlowSolver (MinCostFlowSolver const &rhs) | |
copy constructor More... | |
MinCostFlowSolver & | operator= (MinCostFlowSolver const &rhs) |
assignment More... | |
virtual | ~MinCostFlowSolver () |
destructor | |
MinCostFlowSolver () | |
constructor | |
MinCostFlowSolver (MinCostFlowSolver const &rhs) | |
copy constructor More... | |
MinCostFlowSolver & | operator= (MinCostFlowSolver const &rhs) |
assignment More... | |
virtual | ~MinCostFlowSolver () |
destructor | |
Protected Member Functions | |
void | copy (NetworkSimplex const &rhs) |
copy object | |
void | copy (NetworkSimplex const &rhs) |
copy object | |
![]() | |
void | copy (MinCostFlowSolver const &) |
copy object | |
void | copy (MinCostFlowSolver const &) |
copy object | |
Protected Attributes | |
alg_type::PivotRule | m_pivotRule |
pivot rule for the algorithm, FIRST_ELIGIBLE, BEST_ELIGIBLE, BLOCK_SEARCH, CANDIDATE_LIST, ALTERING_LIST | |
Network simplex algorithm for min-cost flow.
T | coefficient type |
V | variable type |
Definition at line 35 of file DualMinCostFlow.h.
|
inline |
|
inline |
|
inline |
|
inline |
|
inlinevirtual |
API to run min-cost flow solver.
d | dual min-cost flow object |
Implements limbo::solvers::MinCostFlowSolver< T, V >.
Definition at line 732 of file MinCostFlow.h.
|
inlinevirtual |
API to run min-cost flow solver.
d | dual min-cost flow object |
Implements limbo::solvers::MinCostFlowSolver< T, V >.
Definition at line 828 of file DualMinCostFlow.h.
|
inline |
|
inline |