Files @ r807:83ce7ce39f21

Location: LEMON/LEMON-official/lemon/bits/windows.h

Load file history 
r807:83ce7ce39f21
972 B
text/x-chdr
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Rework and fix the implementation of MinMeanCycle (#179) - Fix the handling of the cycle means. - Many implementation improvements: - More efficient data storage for the strongly connected components. - Better handling of BFS queues. - Merge consecutive BFS searches (perform two BFS searches instead of three). This version is about two times faster on average and an order of magnitude faster if there are a lot of strongly connected components.
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

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

 *

 * Copyright (C) 2003-2009

 * 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.

 *

 */



#ifndef LEMON_BITS_WINDOWS_H

#define LEMON_BITS_WINDOWS_H



#include <string>



namespace lemon {

  namespace bits {

    void getWinProcTimes(double &rtime,

                         double &utime, double &stime,

                         double &cutime, double &cstime);

    std::string getWinFormattedDate();

    int getWinRndSeed();

  }

}



#endif