The graph adadptors can be alteration observed.
In most cases it uses the adapted graph alteration notifiers.
Only special case is now the UndirGraphAdaptor, where
we have to proxy the signals from the graph.
The SubBidirGraphAdaptor is removed, because it doest not
gives more feature than the EdgeSubGraphAdaptor<UndirGraphAdaptor<Graph>>.
The ResGraphAdaptor is based on this composition.
3 * This file is a part of LEMON, a generic C++ optimization library
5 * Copyright (C) 2003-2006
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
19 #ifndef LEMON_LP_GLPK_H
20 #define LEMON_LP_GLPK_H
23 ///\brief Header of the LEMON-GLPK lp solver interface.
24 ///\ingroup gen_opt_group
26 #include <lemon/lp_base.h>
34 /// \brief Interface for the GLPK LP solver
36 /// This class implements an interface for the GLPK LP solver.
37 ///\ingroup gen_opt_group
38 class LpGlpk : public LpSolverBase {
44 typedef LpSolverBase Parent;
50 virtual LpSolverBase &_newLp();
51 virtual LpSolverBase &_copyLp();
53 virtual int _addCol();
54 virtual int _addRow();
55 virtual void _eraseCol(int i);
56 virtual void _eraseRow(int i);
57 virtual void _getColName(int col, std::string & name);
58 virtual void _setColName(int col, const std::string & name);
59 virtual void _setRowCoeffs(int i,
62 const Value * values );
63 virtual void _setColCoeffs(int i,
66 const Value * values);
67 virtual void _setCoeff(int row, int col, Value value);
68 virtual void _setColLowerBound(int i, Value value);
69 virtual void _setColUpperBound(int i, Value value);
70 // virtual void _setRowLowerBound(int i, Value value);
71 // virtual void _setRowUpperBound(int i, Value value);
72 virtual void _setRowBounds(int i, Value lower, Value upper);
73 virtual void _setObjCoeff(int i, Value obj_coef);
74 virtual void _clearObj();
75 // virtual void _setObj(int length,
76 // int const * indices,
77 // Value const * values ) = 0;
81 ///\todo It should be clarified
83 virtual SolveExitStatus _solve();
84 virtual Value _getPrimal(int i);
85 virtual Value _getDual(int i);
86 virtual Value _getPrimalValue();
87 virtual bool _isBasicCol(int i);
90 ///\todo It should be clarified
92 virtual SolutionStatus _getPrimalStatus();
93 virtual SolutionStatus _getDualStatus();
94 virtual ProblemTypes _getProblemType();
96 virtual void _setMax();
97 virtual void _setMin();
100 ///Set the verbosity of the messages
102 ///Set the verbosity of the messages
104 ///\param m is the level of the messages output by the solver routines.
105 ///The possible values are:
106 ///- 0 --- no output (default value)
107 ///- 1 --- error messages only
108 ///- 2 --- normal output
109 ///- 3 --- full output (includes informational messages)
110 void messageLevel(int m);
111 ///Turns on or off the presolver
113 ///Turns on (\c b is \c true) or off (\c b is \c false) the presolver
115 ///The presolver is off by default.
116 void presolver(bool b);
119 } //END OF NAMESPACE LEMON
121 #endif //LEMON_LP_GLPK_H