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.
     1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
     2  *
     3  * This file is a part of LEMON, a generic C++ optimization library.
     4  *
     5  * Copyright (C) 2003-2009
     6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
     8  *
     9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    11  * precise terms see the accompanying LICENSE file.
    12  *
    13  * This software is provided "AS IS" with no warranty of any kind,
    14  * express or implied, and with no claim as to its suitability for any
    15  * purpose.
    16  *
    17  */
    18 
    19 #ifndef LEMON_BITS_WINDOWS_H
    20 #define LEMON_BITS_WINDOWS_H
    21 
    22 #include <string>
    23 
    24 namespace lemon {
    25   namespace bits {
    26     void getWinProcTimes(double &rtime,
    27                          double &utime, double &stime,
    28                          double &cutime, double &cstime);
    29     std::string getWinFormattedDate();
    30     int getWinRndSeed();
    31 
    32     class WinLock {
    33     public:
    34       WinLock();
    35       ~WinLock();
    36       void lock();
    37       void unlock();
    38     private:
    39       void *_repr;
    40     };
    41   }
    42 }
    43 
    44 #endif