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