1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/lemon/lp_skeleton.cc	Tue Dec 02 21:40:33 2008 +0100
     1.3 @@ -0,0 +1,187 @@
     1.4 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
     1.5 + *
     1.6 + * This file is a part of LEMON, a generic C++ optimization library.
     1.7 + *
     1.8 + * Copyright (C) 2003-2008
     1.9 + * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10 + * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11 + *
    1.12 + * Permission to use, modify and distribute this software is granted
    1.13 + * provided that this copyright notice appears in all copies. For
    1.14 + * precise terms see the accompanying LICENSE file.
    1.15 + *
    1.16 + * This software is provided "AS IS" with no warranty of any kind,
    1.17 + * express or implied, and with no claim as to its suitability for any
    1.18 + * purpose.
    1.19 + *
    1.20 + */
    1.21 +
    1.22 +#include <lemon/lp_skeleton.h>
    1.23 +
    1.24 +///\file
    1.25 +///\brief A skeleton file to implement LP solver interfaces
    1.26 +namespace lemon {
    1.27 +
    1.28 +  LpSolverBase* LpSkeleton::_newLp()
    1.29 +  {
    1.30 +    LpSolverBase *tmp=0;
    1.31 +    return tmp;
    1.32 +  }
    1.33 +
    1.34 +  LpSolverBase* LpSkeleton::_copyLp()
    1.35 +  {
    1.36 +    LpSolverBase *tmp=0;
    1.37 +    return tmp;
    1.38 +  }
    1.39 +
    1.40 +  int LpSkeleton::_addCol()
    1.41 +  {
    1.42 +    return ++col_num;
    1.43 +  }
    1.44 +
    1.45 +  int LpSkeleton::_addRow()
    1.46 +  {
    1.47 +    return ++row_num;
    1.48 +  }
    1.49 +
    1.50 +  void LpSkeleton::_eraseCol(int ) {
    1.51 +  }
    1.52 +
    1.53 +  void LpSkeleton::_eraseRow(int) {
    1.54 +  }
    1.55 +
    1.56 +  void LpSkeleton::_getColName(int, std::string &) const {
    1.57 +  }
    1.58 +
    1.59 +
    1.60 +  void LpSkeleton::_setColName(int, const std::string &) {
    1.61 +  }
    1.62 +
    1.63 +  int LpSkeleton::_colByName(const std::string&) const { return -1; }
    1.64 +
    1.65 +
    1.66 +  void LpSkeleton::_setRowCoeffs(int, ConstRowIterator, ConstRowIterator) {
    1.67 +  }
    1.68 +
    1.69 +  void LpSkeleton::_getRowCoeffs(int, RowIterator) const {
    1.70 +  }
    1.71 +
    1.72 +  void LpSkeleton::_setColCoeffs(int, ConstColIterator, ConstColIterator) {
    1.73 +  }
    1.74 +
    1.75 +  void LpSkeleton::_getColCoeffs(int, ColIterator) const {
    1.76 +  }
    1.77 +
    1.78 +  void LpSkeleton::_setCoeff(int, int, Value )
    1.79 +  {
    1.80 +  }
    1.81 +
    1.82 +  LpSkeleton::Value LpSkeleton::_getCoeff(int, int) const
    1.83 +  {
    1.84 +    return 0;
    1.85 +  }
    1.86 +
    1.87 +
    1.88 +  void LpSkeleton::_setColLowerBound(int, Value)
    1.89 +  {
    1.90 +  }
    1.91 +
    1.92 +  LpSkeleton::Value LpSkeleton::_getColLowerBound(int) const
    1.93 +  {
    1.94 +    return 0;
    1.95 +  }
    1.96 +
    1.97 +  void LpSkeleton::_setColUpperBound(int, Value)
    1.98 +  {
    1.99 +  }
   1.100 +
   1.101 +  LpSkeleton::Value LpSkeleton::_getColUpperBound(int) const
   1.102 +  {
   1.103 +    return 0;
   1.104 +  }
   1.105 +
   1.106 +//   void LpSkeleton::_setRowLowerBound(int, Value)
   1.107 +//   {
   1.108 +//   }
   1.109 +
   1.110 +//   void LpSkeleton::_setRowUpperBound(int, Value)
   1.111 +//   {
   1.112 +//   }
   1.113 +
   1.114 +  void LpSkeleton::_setRowBounds(int, Value, Value)
   1.115 +  {
   1.116 +  }
   1.117 +
   1.118 +  void LpSkeleton::_getRowBounds(int, Value&, Value&) const
   1.119 +  {
   1.120 +  }
   1.121 +
   1.122 +  void LpSkeleton::_setObjCoeff(int, Value)
   1.123 +  {
   1.124 +  }
   1.125 +
   1.126 +  LpSkeleton::Value LpSkeleton::_getObjCoeff(int) const
   1.127 +  {
   1.128 +    return 0;
   1.129 +  }
   1.130 +
   1.131 +  void LpSkeleton::_setMax()
   1.132 +  {
   1.133 +  }
   1.134 +
   1.135 +  void LpSkeleton::_setMin()
   1.136 +  {
   1.137 +  }
   1.138 +
   1.139 +  bool LpSkeleton::_isMax() const
   1.140 +  {
   1.141 +    return true;
   1.142 +  }
   1.143 +
   1.144 +
   1.145 +  void LpSkeleton::_clearObj()
   1.146 +  {
   1.147 +  }
   1.148 +
   1.149 +  LpSkeleton::SolveExitStatus LpSkeleton::_solve()
   1.150 +  {
   1.151 +    return SOLVED;
   1.152 +  }
   1.153 +
   1.154 +  LpSkeleton::Value LpSkeleton::_getPrimal(int) const
   1.155 +  {
   1.156 +    return 0;
   1.157 +  }
   1.158 +
   1.159 +  LpSkeleton::Value LpSkeleton::_getDual(int) const
   1.160 +  {
   1.161 +    return 0;
   1.162 +  }
   1.163 +
   1.164 +  LpSkeleton::Value LpSkeleton::_getPrimalValue() const
   1.165 +  {
   1.166 +    return 0;
   1.167 +  }
   1.168 +
   1.169 +  LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus() const
   1.170 +  {
   1.171 +    return UNDEFINED;
   1.172 +  }
   1.173 +
   1.174 +  LpSkeleton::SolutionStatus LpSkeleton::_getDualStatus() const
   1.175 +  {
   1.176 +    return UNDEFINED;
   1.177 +  }
   1.178 +
   1.179 +  LpSkeleton::ProblemTypes LpSkeleton::_getProblemType() const
   1.180 +  {
   1.181 +    return UNKNOWN;
   1.182 +  }
   1.183 +
   1.184 +  bool LpSkeleton::_isBasicCol(int) const
   1.185 +  {
   1.186 +    return true;
   1.187 +  }
   1.188 +
   1.189 +} //namespace lemon
   1.190 +