lemon/bits/windows.h
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 15 Nov 2012 07:17:48 +0100
changeset 1013 f6f6896a4724
parent 529 f5bc148f7e1f
child 1092 dceba191c00d
permissions -rw-r--r--
Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.
alpar@491
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
alpar@491
     2
 *
alpar@491
     3
 * This file is a part of LEMON, a generic C++ optimization library.
alpar@491
     4
 *
alpar@491
     5
 * Copyright (C) 2003-2009
alpar@491
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@491
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@491
     8
 *
alpar@491
     9
 * Permission to use, modify and distribute this software is granted
alpar@491
    10
 * provided that this copyright notice appears in all copies. For
alpar@491
    11
 * precise terms see the accompanying LICENSE file.
alpar@491
    12
 *
alpar@491
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@491
    14
 * express or implied, and with no claim as to its suitability for any
alpar@491
    15
 * purpose.
alpar@491
    16
 *
alpar@491
    17
 */
alpar@491
    18
deba@529
    19
#ifndef LEMON_BITS_WINDOWS_H
deba@529
    20
#define LEMON_BITS_WINDOWS_H
alpar@491
    21
alpar@491
    22
#include <string>
alpar@491
    23
alpar@491
    24
namespace lemon {
alpar@491
    25
  namespace bits {
alpar@491
    26
    void getWinProcTimes(double &rtime,
alpar@491
    27
                         double &utime, double &stime,
alpar@491
    28
                         double &cutime, double &cstime);
alpar@491
    29
    std::string getWinFormattedDate();
alpar@491
    30
    int getWinRndSeed();
deba@979
    31
deba@979
    32
    class WinLock {
deba@979
    33
    public:
deba@979
    34
      WinLock();
deba@979
    35
      ~WinLock();
deba@979
    36
      void lock();
deba@979
    37
      void unlock();
deba@979
    38
    private:
deba@979
    39
      void *_repr;
deba@979
    40
    };
alpar@491
    41
  }
alpar@491
    42
}
alpar@491
    43
alpar@491
    44
#endif