COIN-OR::LEMON - Graph Library

source: lemon-0.x/lemon/lp_skeleton.cc @ 2543:a0443c411220

Last change on this file since 2543:a0443c411220 was 2391:14a343be7a5a, checked in by Alpar Juttner, 17 years ago

Happy New Year to all source files!

File size: 3.2 KB
RevLine 
[1254]1/* -*- C++ -*-
2 *
[1956]3 * This file is a part of LEMON, a generic C++ optimization library
4 *
[2391]5 * Copyright (C) 2003-2007
[1956]6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
[1359]7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
[1254]8 *
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.
12 *
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
15 * purpose.
16 *
17 */
18
[1313]19#include <lemon/lp_skeleton.h>
[1254]20
21///\file
22///\brief A skeleton file to implement LP solver interfaces
23namespace lemon {
24 
[1364]25  LpSolverBase &LpSkeleton::_newLp()
26  {
[1368]27    LpSolverBase *tmp=0;
28    return *tmp;
[1364]29  }
30 
31  LpSolverBase &LpSkeleton::_copyLp()
32  {
[1368]33    LpSolverBase *tmp=0;
34    return *tmp;
[1364]35  }
36
[1313]37  int LpSkeleton::_addCol()
[1254]38  {
[1273]39    return ++col_num;
[1254]40  }
41 
[1313]42  int LpSkeleton::_addRow()
[1254]43  {
[1273]44    return ++row_num;
[1254]45  }
46 
[1432]47  void LpSkeleton::_eraseCol(int ) {
48  }
49 
50  void LpSkeleton::_eraseRow(int) {
51  }
52
[2366]53  void LpSkeleton::_getColName(int, std::string &) const {
[1895]54  }
55 
56 
57  void LpSkeleton::_setColName(int, const std::string &) {
58  }
[2366]59
60  int LpSkeleton::_colByName(const std::string&) const { return -1; }
[1895]61 
62 
[2364]63  void LpSkeleton::_setRowCoeffs(int, ConstRowIterator, ConstRowIterator) {
64  }
65
[2366]66  void LpSkeleton::_getRowCoeffs(int, RowIterator) const {
[1254]67  }
68 
[2364]69  void LpSkeleton::_setColCoeffs(int, ConstColIterator, ConstColIterator) {
70  }
71
[2366]72  void LpSkeleton::_getColCoeffs(int, ColIterator) const {
[1254]73  }
[1431]74
75  void LpSkeleton::_setCoeff(int, int, Value )
76  {
77  }
78
[2366]79  LpSkeleton::Value LpSkeleton::_getCoeff(int, int) const
[2324]80  {
81    return 0;
82  }
83
[1431]84
[1362]85  void LpSkeleton::_setColLowerBound(int, Value)
[1254]86  {
87  }
88 
[2366]89  LpSkeleton::Value LpSkeleton::_getColLowerBound(int) const
[2328]90  {
91    return 0;
92  }
93 
[1362]94  void LpSkeleton::_setColUpperBound(int, Value)
[1254]95  {
96  }
[2328]97
[2366]98  LpSkeleton::Value LpSkeleton::_getColUpperBound(int) const
[2328]99  {
100    return 0;
101  }
[1254]102 
[1405]103//   void LpSkeleton::_setRowLowerBound(int, Value)
104//   {
105//   }
[1254]106 
[1405]107//   void LpSkeleton::_setRowUpperBound(int, Value)
108//   {
109//   }
[1389]110
[1390]111  void LpSkeleton::_setRowBounds(int, Value, Value)
[1389]112  {
113  }
[2328]114
[2366]115  void LpSkeleton::_getRowBounds(int, Value&, Value&) const
[2328]116  {
117  }
[1254]118 
[1362]119  void LpSkeleton::_setObjCoeff(int, Value)
[1254]120  {
121  }
[1263]122
[2366]123  LpSkeleton::Value LpSkeleton::_getObjCoeff(int) const
124  {
[2324]125    return 0;
126  }
127
[1313]128  void LpSkeleton::_setMax()
[1312]129  {
130  }
[1390]131
[1313]132  void LpSkeleton::_setMin()
[1312]133  {
134  }
135
[2366]136  bool LpSkeleton::_isMax() const
[2324]137  {
138    return true;
139  }
140
141
[1390]142  void LpSkeleton::_clearObj()
143  {
144  }
145 
[1313]146  LpSkeleton::SolveExitStatus LpSkeleton::_solve()
[1263]147  {
[1293]148    return SOLVED;
[1263]149  }
150
[2366]151  LpSkeleton::Value LpSkeleton::_getPrimal(int) const
[1263]152  {
153    return 0;
154  }
[1254]155 
[2366]156  LpSkeleton::Value LpSkeleton::_getDual(int) const
[1796]157  {
158    return 0;
159  }
160 
[2366]161  LpSkeleton::Value LpSkeleton::_getPrimalValue() const
[1312]162  {
163    return 0;
164  }
165 
[2366]166  LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus() const
[1294]167  {
[1460]168    return UNDEFINED;
169  }
170
[2366]171  LpSkeleton::SolutionStatus LpSkeleton::_getDualStatus() const
[1460]172  {
173    return UNDEFINED;
174  }
175
[2366]176  LpSkeleton::ProblemTypes LpSkeleton::_getProblemType() const
[1460]177  {
178    return UNKNOWN;
[1294]179  }
[1843]180
[2366]181  bool LpSkeleton::_isBasicCol(int) const
[1843]182  {
183    return true;
184  }
185
[1254]186} //namespace lemon
187
Note: See TracBrowser for help on using the repository browser.