test/random_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Tue, 15 Mar 2011 19:32:21 +0100
changeset 1047 ddd3c0d3d9bf
parent 209 765619b7cbb2
child 1379 db1d342a1087
permissions -rw-r--r--
Implement the scaling Price Refinement heuristic in CostScaling (#417)
instead of Early Termination.

These two heuristics are similar, but the newer one is faster
and not only makes it possible to skip some epsilon phases, but
it can improve the performance of the other phases, as well.
     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 #include <lemon/random.h>
    20 #include "test_tools.h"
    21 
    22 int seed_array[] = {1, 2};
    23 
    24 int main()
    25 {
    26   double a=lemon::rnd();
    27   check(a<1.0&&a>0.0,"This should be in [0,1)");
    28   a=lemon::rnd.gauss();
    29   a=lemon::rnd.gamma(3.45,0);
    30   a=lemon::rnd.gamma(4);
    31   //Does gamma work with integer k?
    32   a=lemon::rnd.gamma(4.0,0);
    33   a=lemon::rnd.poisson(.5);
    34 
    35   lemon::rnd.seed(100);
    36   lemon::rnd.seed(seed_array, seed_array +
    37                   (sizeof(seed_array) / sizeof(seed_array[0])));
    38 
    39   return 0;
    40 }