test/time_measure_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 872 fa6f37d7a25b
parent 463 88ed40ad0d4f
child 1157 761fe0846f49
permissions -rw-r--r--
Entirely rework CapacityScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.
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@463
     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;
kpeter@605
    42
  for(n=0;T.realTime()<0.1;n++) ;
alpar@119
    43
  std::cout << T << " (" << n << " time queries)\n";
kpeter@605
    44
alpar@119
    45
  TimeStamp full;
alpar@119
    46
  TimeStamp t;
kpeter@605
    47
  t=runningTimeTest(f,0.1,&n,&full);
alpar@119
    48
  std::cout << t << " (" << n << " tests)\n";
alpar@119
    49
  std::cout << "Total: " << full << "\n";
alpar@209
    50
kpeter@605
    51
  t=runningTimeTest(g,0.1,&n,&full);
alpar@119
    52
  std::cout << t << " (" << n << " tests)\n";
alpar@119
    53
  std::cout << "Total: " << full << "\n";
alpar@209
    54
alpar@119
    55
  return 0;
alpar@119
    56
}