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