lemon/random.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 15 Nov 2012 07:17:48 +0100
changeset 1013 f6f6896a4724
parent 209 765619b7cbb2
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@209
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
alpar@10
     2
 *
alpar@209
     3
 * This file is a part of LEMON, a generic C++ optimization library.
alpar@10
     4
 *
alpar@440
     5
 * Copyright (C) 2003-2009
alpar@10
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@10
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@10
     8
 *
alpar@10
     9
 * Permission to use, modify and distribute this software is granted
alpar@10
    10
 * provided that this copyright notice appears in all copies. For
alpar@10
    11
 * precise terms see the accompanying LICENSE file.
alpar@10
    12
 *
alpar@10
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@10
    14
 * express or implied, and with no claim as to its suitability for any
alpar@10
    15
 * purpose.
alpar@10
    16
 *
alpar@10
    17
 */
alpar@10
    18
alpar@10
    19
///\file
alpar@10
    20
///\brief Instantiation of the Random class.
alpar@10
    21
alpar@10
    22
#include <lemon/random.h>
alpar@10
    23
alpar@10
    24
namespace lemon {
alpar@10
    25
  /// \brief Global random number generator instance
alpar@10
    26
  ///
kpeter@16
    27
  /// A global Mersenne Twister random number generator instance.
alpar@10
    28
  Random rnd;
alpar@10
    29
}