1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/lemon/lp_skeleton.cc	Mon May 23 04:48:14 2005 +0000
     1.3 @@ -0,0 +1,127 @@
     1.4 +/* -*- C++ -*-
     1.5 + * lemon/lp_skeleton.cc - Part of LEMON, a generic C++ optimization library
     1.6 + *
     1.7 + * Copyright (C) 2005 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     1.8 + * (Egervary Research Group on Combinatorial Optimization, EGRES).
     1.9 + *
    1.10 + * Permission to use, modify and distribute this software is granted
    1.11 + * provided that this copyright notice appears in all copies. For
    1.12 + * precise terms see the accompanying LICENSE file.
    1.13 + *
    1.14 + * This software is provided "AS IS" with no warranty of any kind,
    1.15 + * express or implied, and with no claim as to its suitability for any
    1.16 + * purpose.
    1.17 + *
    1.18 + */
    1.19 +
    1.20 +#include <lemon/lp_skeleton.h>
    1.21 +
    1.22 +///\file
    1.23 +///\brief A skeleton file to implement LP solver interfaces
    1.24 +namespace lemon {
    1.25 +  
    1.26 +  LpSolverBase &LpSkeleton::_newLp()
    1.27 +  {
    1.28 +    LpSolverBase *tmp=0;
    1.29 +    return *tmp;
    1.30 +  }
    1.31 +  
    1.32 +  LpSolverBase &LpSkeleton::_copyLp()
    1.33 +  {
    1.34 +    LpSolverBase *tmp=0;
    1.35 +    return *tmp;
    1.36 +  }
    1.37 +
    1.38 +  int LpSkeleton::_addCol()
    1.39 +  {
    1.40 +    return ++col_num;
    1.41 +  }
    1.42 +  
    1.43 +  int LpSkeleton::_addRow() 
    1.44 +  {
    1.45 +    return ++row_num;
    1.46 +  }
    1.47 +  
    1.48 +  void LpSkeleton::_eraseCol(int ) {
    1.49 +  }
    1.50 +  
    1.51 +  void LpSkeleton::_eraseRow(int) {
    1.52 +  }
    1.53 +
    1.54 +  void LpSkeleton::_setRowCoeffs(int, 
    1.55 +				 int,
    1.56 +				 int  const *, 
    1.57 +				 Value  const *)
    1.58 +  {
    1.59 +  }
    1.60 +  
    1.61 +  void LpSkeleton::_setColCoeffs(int, 
    1.62 +				 int,
    1.63 +				 int  const *, 
    1.64 +				 Value  const *)
    1.65 +  {
    1.66 +  }
    1.67 +
    1.68 +  void LpSkeleton::_setCoeff(int, int, Value )
    1.69 +  {
    1.70 +  }
    1.71 +
    1.72 +
    1.73 +  void LpSkeleton::_setColLowerBound(int, Value)
    1.74 +  {
    1.75 +  }
    1.76 +  
    1.77 +  void LpSkeleton::_setColUpperBound(int, Value)
    1.78 +  {
    1.79 +  }
    1.80 +  
    1.81 +//   void LpSkeleton::_setRowLowerBound(int, Value)
    1.82 +//   {
    1.83 +//   }
    1.84 +  
    1.85 +//   void LpSkeleton::_setRowUpperBound(int, Value)
    1.86 +//   {
    1.87 +//   }
    1.88 +
    1.89 +  void LpSkeleton::_setRowBounds(int, Value, Value)
    1.90 +  {
    1.91 +  }
    1.92 +  
    1.93 +  void LpSkeleton::_setObjCoeff(int, Value)
    1.94 +  {
    1.95 +  }
    1.96 +
    1.97 +  void LpSkeleton::_setMax()
    1.98 +  {
    1.99 +  }
   1.100 +
   1.101 +  void LpSkeleton::_setMin()
   1.102 +  {
   1.103 +  }
   1.104 +
   1.105 +  void LpSkeleton::_clearObj()
   1.106 +  {
   1.107 +  }
   1.108 +  
   1.109 +  LpSkeleton::SolveExitStatus LpSkeleton::_solve()
   1.110 +  {
   1.111 +    return SOLVED;
   1.112 +  }
   1.113 +
   1.114 +  LpSkeleton::Value LpSkeleton::_getPrimal(int)
   1.115 +  {
   1.116 +    return 0;
   1.117 +  }
   1.118 +  
   1.119 +  LpSkeleton::Value LpSkeleton::_getPrimalValue()
   1.120 +  {
   1.121 +    return 0;
   1.122 +  }
   1.123 +  
   1.124 +  LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus()
   1.125 +  {
   1.126 +    return OPTIMAL;
   1.127 +  }
   1.128 +  
   1.129 +} //namespace lemon
   1.130 +