deba@458: /* -*- mode: C++; indent-tabs-mode: nil; -*-
deba@458:  *
deba@458:  * This file is a part of LEMON, a generic C++ optimization library.
deba@458:  *
deba@458:  * Copyright (C) 2003-2008
deba@458:  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
deba@458:  * (Egervary Research Group on Combinatorial Optimization, EGRES).
deba@458:  *
deba@458:  * Permission to use, modify and distribute this software is granted
deba@458:  * provided that this copyright notice appears in all copies. For
deba@458:  * precise terms see the accompanying LICENSE file.
deba@458:  *
deba@458:  * This software is provided "AS IS" with no warranty of any kind,
deba@458:  * express or implied, and with no claim as to its suitability for any
deba@458:  * purpose.
deba@458:  *
deba@458:  */
deba@458: 
deba@458: #include <lemon/lp_skeleton.h>
deba@458: 
deba@458: ///\file
deba@458: ///\brief A skeleton file to implement LP solver interfaces
deba@458: namespace lemon {
deba@458: 
deba@458:   LpSolverBase* LpSkeleton::_newLp()
deba@458:   {
deba@458:     LpSolverBase *tmp=0;
deba@458:     return tmp;
deba@458:   }
deba@458: 
deba@458:   LpSolverBase* LpSkeleton::_copyLp()
deba@458:   {
deba@458:     LpSolverBase *tmp=0;
deba@458:     return tmp;
deba@458:   }
deba@458: 
deba@458:   int LpSkeleton::_addCol()
deba@458:   {
deba@458:     return ++col_num;
deba@458:   }
deba@458: 
deba@458:   int LpSkeleton::_addRow()
deba@458:   {
deba@458:     return ++row_num;
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_eraseCol(int ) {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_eraseRow(int) {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_getColName(int, std::string &) const {
deba@458:   }
deba@458: 
deba@458: 
deba@458:   void LpSkeleton::_setColName(int, const std::string &) {
deba@458:   }
deba@458: 
deba@458:   int LpSkeleton::_colByName(const std::string&) const { return -1; }
deba@458: 
deba@458: 
deba@458:   void LpSkeleton::_setRowCoeffs(int, ConstRowIterator, ConstRowIterator) {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_getRowCoeffs(int, RowIterator) const {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_setColCoeffs(int, ConstColIterator, ConstColIterator) {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_getColCoeffs(int, ColIterator) const {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_setCoeff(int, int, Value )
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::Value LpSkeleton::_getCoeff(int, int) const
deba@458:   {
deba@458:     return 0;
deba@458:   }
deba@458: 
deba@458: 
deba@458:   void LpSkeleton::_setColLowerBound(int, Value)
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::Value LpSkeleton::_getColLowerBound(int) const
deba@458:   {
deba@458:     return 0;
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_setColUpperBound(int, Value)
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::Value LpSkeleton::_getColUpperBound(int) const
deba@458:   {
deba@458:     return 0;
deba@458:   }
deba@458: 
deba@458: //   void LpSkeleton::_setRowLowerBound(int, Value)
deba@458: //   {
deba@458: //   }
deba@458: 
deba@458: //   void LpSkeleton::_setRowUpperBound(int, Value)
deba@458: //   {
deba@458: //   }
deba@458: 
deba@458:   void LpSkeleton::_setRowBounds(int, Value, Value)
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_getRowBounds(int, Value&, Value&) const
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_setObjCoeff(int, Value)
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::Value LpSkeleton::_getObjCoeff(int) const
deba@458:   {
deba@458:     return 0;
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_setMax()
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   void LpSkeleton::_setMin()
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   bool LpSkeleton::_isMax() const
deba@458:   {
deba@458:     return true;
deba@458:   }
deba@458: 
deba@458: 
deba@458:   void LpSkeleton::_clearObj()
deba@458:   {
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::SolveExitStatus LpSkeleton::_solve()
deba@458:   {
deba@458:     return SOLVED;
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::Value LpSkeleton::_getPrimal(int) const
deba@458:   {
deba@458:     return 0;
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::Value LpSkeleton::_getDual(int) const
deba@458:   {
deba@458:     return 0;
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::Value LpSkeleton::_getPrimalValue() const
deba@458:   {
deba@458:     return 0;
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus() const
deba@458:   {
deba@458:     return UNDEFINED;
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::SolutionStatus LpSkeleton::_getDualStatus() const
deba@458:   {
deba@458:     return UNDEFINED;
deba@458:   }
deba@458: 
deba@458:   LpSkeleton::ProblemTypes LpSkeleton::_getProblemType() const
deba@458:   {
deba@458:     return UNKNOWN;
deba@458:   }
deba@458: 
deba@458:   bool LpSkeleton::_isBasicCol(int) const
deba@458:   {
deba@458:     return true;
deba@458:   }
deba@458: 
deba@458: } //namespace lemon
deba@458: