test/time_measure_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Fri, 17 Apr 2009 18:04:36 +0200
changeset 609 e6927fe719e6
parent 209 765619b7cbb2
child 558 f53d641aa967
permissions -rw-r--r--
Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
alpar@209
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
alpar@119
     2
 *
alpar@209
     3
 * This file is a part of LEMON, a generic C++ optimization library.
alpar@119
     4
 *
alpar@440
     5
 * Copyright (C) 2003-2009
alpar@119
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@119
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@119
     8
 *
alpar@119
     9
 * Permission to use, modify and distribute this software is granted
alpar@119
    10
 * provided that this copyright notice appears in all copies. For
alpar@119
    11
 * precise terms see the accompanying LICENSE file.
alpar@119
    12
 *
alpar@119
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@119
    14
 * express or implied, and with no claim as to its suitability for any
alpar@119
    15
 * purpose.
alpar@119
    16
 *
alpar@119
    17
 */
alpar@119
    18
alpar@119
    19
#include <lemon/time_measure.h>
alpar@119
    20
alpar@119
    21
using namespace lemon;
alpar@119
    22
alpar@209
    23
void f()
alpar@119
    24
{
alpar@119
    25
  double d=0;
alpar@119
    26
  for(int i=0;i<1000;i++)
alpar@119
    27
    d+=0.1;
alpar@119
    28
}
alpar@119
    29
alpar@209
    30
void g()
alpar@119
    31
{
alpar@119
    32
  static Timer T;
alpar@209
    33
alpar@119
    34
  for(int i=0;i<1000;i++)
alpar@119
    35
    TimeStamp x(T);
alpar@119
    36
}
alpar@119
    37
alpar@119
    38
int main()
alpar@119
    39
{
alpar@119
    40
  Timer T;
alpar@119
    41
  unsigned int n;
alpar@119
    42
  for(n=0;T.realTime()<1.0;n++) ;
alpar@119
    43
  std::cout << T << " (" << n << " time queries)\n";
alpar@119
    44
  T.restart();
alpar@119
    45
  while(T.realTime()<2.0) ;
alpar@119
    46
  std::cout << T << '\n';
alpar@119
    47
  TimeStamp full;
alpar@119
    48
  TimeStamp t;
alpar@119
    49
  t=runningTimeTest(f,1,&n,&full);
alpar@119
    50
  std::cout << t << " (" << n << " tests)\n";
alpar@119
    51
  std::cout << "Total: " << full << "\n";
alpar@209
    52
alpar@119
    53
  t=runningTimeTest(g,1,&n,&full);
alpar@119
    54
  std::cout << t << " (" << n << " tests)\n";
alpar@119
    55
  std::cout << "Total: " << full << "\n";
alpar@209
    56
alpar@119
    57
  return 0;
alpar@119
    58
}