lemon/lp_skeleton.cc
author hegyi
Fri, 06 Jan 2006 16:07:08 +0000
changeset 1884 9c061834b33b
parent 1855 c72636dcf0bd
child 1895 5b01801efbc0
permissions -rw-r--r--
In algorithm window maps can be selected and reated through MapSelector widget.
     1 /* -*- C++ -*-
     2  * lemon/lp_skeleton.cc - Part of LEMON, a generic C++ optimization library
     3  *
     4  * Copyright (C) 2006 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     5  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     6  *
     7  * Permission to use, modify and distribute this software is granted
     8  * provided that this copyright notice appears in all copies. For
     9  * precise terms see the accompanying LICENSE file.
    10  *
    11  * This software is provided "AS IS" with no warranty of any kind,
    12  * express or implied, and with no claim as to its suitability for any
    13  * purpose.
    14  *
    15  */
    16 
    17 #include <lemon/lp_skeleton.h>
    18 
    19 ///\file
    20 ///\brief A skeleton file to implement LP solver interfaces
    21 namespace lemon {
    22   
    23   LpSolverBase &LpSkeleton::_newLp()
    24   {
    25     LpSolverBase *tmp=0;
    26     return *tmp;
    27   }
    28   
    29   LpSolverBase &LpSkeleton::_copyLp()
    30   {
    31     LpSolverBase *tmp=0;
    32     return *tmp;
    33   }
    34 
    35   int LpSkeleton::_addCol()
    36   {
    37     return ++col_num;
    38   }
    39   
    40   int LpSkeleton::_addRow() 
    41   {
    42     return ++row_num;
    43   }
    44   
    45   void LpSkeleton::_eraseCol(int ) {
    46   }
    47   
    48   void LpSkeleton::_eraseRow(int) {
    49   }
    50 
    51   void LpSkeleton::_setRowCoeffs(int, 
    52 				 int,
    53 				 int  const *, 
    54 				 Value  const *)
    55   {
    56   }
    57   
    58   void LpSkeleton::_setColCoeffs(int, 
    59 				 int,
    60 				 int  const *, 
    61 				 Value  const *)
    62   {
    63   }
    64 
    65   void LpSkeleton::_setCoeff(int, int, Value )
    66   {
    67   }
    68 
    69 
    70   void LpSkeleton::_setColLowerBound(int, Value)
    71   {
    72   }
    73   
    74   void LpSkeleton::_setColUpperBound(int, Value)
    75   {
    76   }
    77   
    78 //   void LpSkeleton::_setRowLowerBound(int, Value)
    79 //   {
    80 //   }
    81   
    82 //   void LpSkeleton::_setRowUpperBound(int, Value)
    83 //   {
    84 //   }
    85 
    86   void LpSkeleton::_setRowBounds(int, Value, Value)
    87   {
    88   }
    89   
    90   void LpSkeleton::_setObjCoeff(int, Value)
    91   {
    92   }
    93 
    94   void LpSkeleton::_setMax()
    95   {
    96   }
    97 
    98   void LpSkeleton::_setMin()
    99   {
   100   }
   101 
   102   void LpSkeleton::_clearObj()
   103   {
   104   }
   105   
   106   LpSkeleton::SolveExitStatus LpSkeleton::_solve()
   107   {
   108     return SOLVED;
   109   }
   110 
   111   LpSkeleton::Value LpSkeleton::_getPrimal(int)
   112   {
   113     return 0;
   114   }
   115   
   116   LpSkeleton::Value LpSkeleton::_getDual(int)
   117   {
   118     return 0;
   119   }
   120   
   121   LpSkeleton::Value LpSkeleton::_getPrimalValue()
   122   {
   123     return 0;
   124   }
   125   
   126   LpSkeleton::SolutionStatus LpSkeleton::_getPrimalStatus()
   127   {
   128     return UNDEFINED;
   129   }
   130 
   131   LpSkeleton::SolutionStatus LpSkeleton::_getDualStatus()
   132   {
   133     return UNDEFINED;
   134   }
   135 
   136   LpSkeleton::ProblemTypes LpSkeleton::_getProblemType()
   137   {
   138     return UNKNOWN;
   139   }
   140 
   141   bool LpSkeleton::_isBasicCol(int)
   142   {
   143     return true;
   144   }
   145 
   146 } //namespace lemon
   147