RhodeCode

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2011

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <lemon/list_graph.h>

#include <lemon/lgf_reader.h>

#include "test_tools.h"

using namespace lemon;

char test_lgf[] =

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "@arcs\n"

  "     label\n"

  "0 1  0\n"

  "1 0  1\n"

  "@attributes\n"

  "source 0\n"

  "target 1\n";

char test_lgf_nomap[] =

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "@arcs\n"

  "     -\n"

  "0 1\n";

char test_lgf_bad1[] =

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "@arcs\n"

  "     - another\n"

  "0 1\n";

char test_lgf_bad2[] =

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "@arcs\n"

  "     label -\n"

  "0 1\n";

int main()

{

  {

    ListDigraph d;

    ListDigraph::Node s,t;

    ListDigraph::ArcMap<int> label(d);

    std::istringstream input(test_lgf);

    digraphReader(d, input).

      node("source", s).

      node("target", t).

      arcMap("label", label).

      run();

    check(countNodes(d) == 2,"There should be 2 nodes");

    check(countArcs(d) == 2,"There should be 2 arcs");

  }

  {

    ListGraph g;

    ListGraph::Node s,t;

    ListGraph::EdgeMap<int> label(g);

    std::istringstream input(test_lgf);

    graphReader(g, input).

      node("source", s).

      node("target", t).

      edgeMap("label", label).

      run();

    check(countNodes(g) == 2,"There should be 2 nodes");

    check(countEdges(g) == 2,"There should be 2 arcs");

  }

  {

    ListDigraph d;

    std::istringstream input(test_lgf_nomap);

    digraphReader(d, input).

      run();

    check(countNodes(d) == 2,"There should be 2 nodes");

    check(countArcs(d) == 1,"There should be 1 arc");

  }

  {

    ListGraph g;

    std::istringstream input(test_lgf_nomap);

    graphReader(g, input).

      run();

    check(countNodes(g) == 2,"There should be 2 nodes");

    check(countEdges(g) == 1,"There should be 1 edge");

  }

  {

    ListDigraph d;

    std::istringstream input(test_lgf_bad1);

    bool ok=false;

    try {

      digraphReader(d, input).

        run();

    }

      {

        ok = true;

      }

    check(ok,"FormatError exception should have occured");

  }

  {

    ListGraph g;

    std::istringstream input(test_lgf_bad1);

    bool ok=false;

    try {

      graphReader(g, input).

        run();

    }

    catch (FormatError&)

      {

        ok = true;

      }

    check(ok,"FormatError exception should have occured");

  }

  {

    ListDigraph d;

    std::istringstream input(test_lgf_bad2);

    bool ok=false;

    try {

      digraphReader(d, input).

        run();

    }

    catch (FormatError&)

      {

        ok = true;

      }

    check(ok,"FormatError exception should have occured");

  }

  {

    ListGraph g;

    std::istringstream input(test_lgf_bad2);

    bool ok=false;

    try {

      graphReader(g, input).

        run();

    }

    catch (FormatError&)

      {

        ok = true;

      }

    check(ok,"FormatError exception should have occured");

  }

}

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <sstream>

#include <lemon/lp_skeleton.h>

#include "test_tools.h"

#include <lemon/tolerance.h>

#include <lemon/config.h>

#ifdef LEMON_HAVE_GLPK

#include <lemon/glpk.h>

#endif

#ifdef LEMON_HAVE_CPLEX

#include <lemon/cplex.h>

#endif

#ifdef LEMON_HAVE_SOPLEX

#include <lemon/soplex.h>

#endif

#ifdef LEMON_HAVE_CLP

#include <lemon/clp.h>

#endif

using namespace lemon;

void lpTest(LpSolver& lp)

{

  typedef LpSolver LP;

  std::vector<LP::Col> x(10);

  //  for(int i=0;i<10;i++) x.push_back(lp.addCol());

  lp.addColSet(x);

  lp.colLowerBound(x,1);

  lp.colUpperBound(x,1);

  lp.colBounds(x,1,2);

  std::vector<LP::Col> y(10);

  lp.addColSet(y);

  lp.colLowerBound(y,1);

  lp.colUpperBound(y,1);

  lp.colBounds(y,1,2);

  std::map<int,LP::Col> z;

  z.insert(std::make_pair(12,INVALID));

  z.insert(std::make_pair(2,INVALID));

  z.insert(std::make_pair(7,INVALID));

  z.insert(std::make_pair(5,INVALID));

  lp.addColSet(z);

  lp.colLowerBound(z,1);

  lp.colUpperBound(z,1);

  lp.colBounds(z,1,2);

  {

    LP::Expr e,f,g;

    LP::Col p1,p2,p3,p4,p5;

    LP::Constr c;

    p1=lp.addCol();

    p2=lp.addCol();

    p3=lp.addCol();

    p4=lp.addCol();

    p5=lp.addCol();

    e[p1]=2;

    *e=12;

    e[p1]+=2;

    *e+=12;

    e[p1]-=2;

    *e-=12;

    e=2;

    e=2.2;

    e=p1;

    e=f;

    e+=2;

    e+=2.2;

    e+=p1;

    e+=f;

    e-=2;

    e-=2.2;

    e-=p1;

    e-=f;

    e*=2;

    e*=2.2;

    e/=2;

    e/=2.2;

    e=((p1+p2)+(p1-p2)+(p1+12)+(12+p1)+(p1-12)+(12-p1)+

       (f+12)+(12+f)+(p1+f)+(f+p1)+(f+g)+

       (f-12)+(12-f)+(p1-f)+(f-p1)+(f-g)+

       2.2*f+f*2.2+f/2.2+

       2*f+f*2+f/2+

       2.2*p1+p1*2.2+p1/2.2+

       2*p1+p1*2+p1/2

       );

    c = (e  <= f  );

    c = (e  <= 2.2);

    c = (e  <= 2  );

    c = (e  <= p1 );

    c = (2.2<= f  );

    c = (2  <= f  );

    c = (p1 <= f  );

    c = (p1 <= p2 );

    c = (p1 <= 2.2);

    c = (p1 <= 2  );