NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.
2 * lemon/lp_skeleton.cc - Part of LEMON, a generic C++ optimization library
4 * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Research Group on Combinatorial Optimization, EGRES).
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
17 #include <lemon/lp_skeleton.h>
20 ///\brief A skeleton file to implement LP solver interfaces
23 LpSolverBase &LpSkeleton::_newLp()
29 LpSolverBase &LpSkeleton::_copyLp()
35 int LpSkeleton::_addCol()
40 int LpSkeleton::_addRow()
45 void LpSkeleton::_eraseCol(int ) {
48 void LpSkeleton::_eraseRow(int) {
51 void LpSkeleton::_setRowCoeffs(int,
58 void LpSkeleton::_setColCoeffs(int,
65 void LpSkeleton::_setCoeff(int, int, Value )
70 void LpSkeleton::_setColLowerBound(int, Value)
74 void LpSkeleton::_setColUpperBound(int, Value)
78 // void LpSkeleton::_setRowLowerBound(int, Value)
82 // void LpSkeleton::_setRowUpperBound(int, Value)
86 void LpSkeleton::_setRowBounds(int, Value, Value)
90 void LpSkeleton::_setObjCoeff(int, Value)
94 void LpSkeleton::_setMax()
98 void LpSkeleton::_setMin()
102 void LpSkeleton::_clearObj()
106 LpSkeleton::SolveExitStatus LpSkeleton::_solve()
111 LpSkeleton::Value LpSkeleton::_getPrimal(int)
116 LpSkeleton::Value LpSkeleton::_getDual(int)
121 LpSkeleton::Value LpSkeleton::_getPrimalValue()
126 LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus()
131 LpSkeleton::SolutionStatus LpSkeleton::_getDualStatus()
136 LpSkeleton::ProblemTypes LpSkeleton::_getProblemType()