|
Limbo 3.5.4
|
solve network flow graph with min-cost flow More...
#include <Lgf.h>
Public Types | |
| typedef T | value_type |
| typedef value_type | cost_type |
| typedef lemon::SmartDigraph | graph_type |
| typedef graph_type::Node | node_type |
| typedef graph_type::Arc | arc_type |
| typedef graph_type::NodeMap< value_type > | node_value_map_type |
| typedef graph_type::NodeMap< string > | node_name_map_type |
| typedef graph_type::ArcMap< value_type > | arc_value_map_type |
| typedef graph_type::ArcMap< value_type > | arc_cost_map_type |
| typedef graph_type::ArcMap< value_type > | arc_flow_map_type |
| typedef graph_type::NodeMap< value_type > | node_pot_map_type |
| typedef lemon::NetworkSimplex< graph_type, value_type, cost_type > | alg_network_simplex_type |
| typedef lemon::CostScaling< graph_type, value_type, cost_type > | alg_cost_scaling_type |
| typedef alg_cost_scaling_type | alg_type |
Public Member Functions | |
| Lgf () | |
| constructor | |
| virtual | ~Lgf () |
| destructor | |
| alg_type::ProblemType | operator() (string const &filename) |
| API to run the algorithm. | |
| virtual void | print_graph (string const &filename) const |
| print graph | |
| virtual void | print_solution (string const &filename) const |
| print solution | |
| void | read_lgf (string const &lgfFile) |
| read input file in .lgf format and initialize graph | |
Protected Member Functions | |
| alg_type::ProblemType | run () |
| run algorithm | |
Protected Attributes | |
| graph_type | m_graph |
| input graph | |
| arc_value_map_type | m_hLower |
| lower bound of flow, usually zero | |
| arc_value_map_type | m_hUpper |
| upper bound of flow, arc capacity in mcf | |
| arc_cost_map_type | m_hCost |
| arc cost in mcf | |
| node_value_map_type | m_hSupply |
| node supply in mcf | |
| node_name_map_type | m_hName |
| node name in mcf | |
| cost_type | m_totalcost |
| total cost after solving | |
| arc_flow_map_type | m_hFlow |
| solution of min-cost flow, which is the dual solution of LP | |
| node_pot_map_type | m_hPot |
| dual solution of min-cost flow, which is the solution of LP | |
solve network flow graph with min-cost flow
| T | data type |
| typedef lemon::CostScaling<graph_type, value_type, cost_type> limbo::solvers::lpmcf::Lgf< T >::alg_cost_scaling_type |
| typedef lemon::NetworkSimplex<graph_type, value_type, cost_type> limbo::solvers::lpmcf::Lgf< T >::alg_network_simplex_type |
| typedef alg_cost_scaling_type limbo::solvers::lpmcf::Lgf< T >::alg_type |
| typedef graph_type::ArcMap<value_type> limbo::solvers::lpmcf::Lgf< T >::arc_cost_map_type |
| typedef graph_type::ArcMap<value_type> limbo::solvers::lpmcf::Lgf< T >::arc_flow_map_type |
| typedef graph_type::Arc limbo::solvers::lpmcf::Lgf< T >::arc_type |
| typedef graph_type::ArcMap<value_type> limbo::solvers::lpmcf::Lgf< T >::arc_value_map_type |
| typedef value_type limbo::solvers::lpmcf::Lgf< T >::cost_type |
| typedef lemon::SmartDigraph limbo::solvers::lpmcf::Lgf< T >::graph_type |
| typedef graph_type::NodeMap<string> limbo::solvers::lpmcf::Lgf< T >::node_name_map_type |
| typedef graph_type::NodeMap<value_type> limbo::solvers::lpmcf::Lgf< T >::node_pot_map_type |
| typedef graph_type::Node limbo::solvers::lpmcf::Lgf< T >::node_type |
| typedef graph_type::NodeMap<value_type> limbo::solvers::lpmcf::Lgf< T >::node_value_map_type |
| typedef T limbo::solvers::lpmcf::Lgf< T >::value_type |
|
inline |
|
inlinevirtual |
|
inline |
|
inlinevirtual |
|
inlinevirtual |
print solution
| filename | output file name |
Reimplemented in limbo::solvers::lpmcf::LpDualMcf< T >.
|
inline |
|
inlineprotected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |