test/random_test.cc
author kpeter
Mon, 01 Jun 2009 15:37:51 +0000
changeset 2636 1f99c95ddd2d
parent 2596 9c00e972cdfd
permissions -rw-r--r--
Add the Cancel and Tighten min cost flow algorithm
alpar@2483
     1
/* -*- C++ -*-
alpar@2483
     2
 *
alpar@2483
     3
 * This file is a part of LEMON, a generic C++ optimization library
alpar@2483
     4
 *
alpar@2553
     5
 * Copyright (C) 2003-2008
alpar@2483
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@2483
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@2483
     8
 *
alpar@2483
     9
 * Permission to use, modify and distribute this software is granted
alpar@2483
    10
 * provided that this copyright notice appears in all copies. For
alpar@2483
    11
 * precise terms see the accompanying LICENSE file.
alpar@2483
    12
 *
alpar@2483
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@2483
    14
 * express or implied, and with no claim as to its suitability for any
alpar@2483
    15
 * purpose.
alpar@2483
    16
 *
alpar@2483
    17
 */
alpar@2483
    18
alpar@2483
    19
#include <lemon/random.h>
alpar@2483
    20
#include "test_tools.h"
alpar@2483
    21
alpar@2483
    22
///\file \brief Test cases for random.h
alpar@2483
    23
///
alpar@2483
    24
///\todo To be extended
alpar@2483
    25
///
alpar@2483
    26
deba@2597
    27
int seed_array[] = {1, 2};
deba@2597
    28
alpar@2483
    29
int main()
alpar@2483
    30
{
alpar@2483
    31
  double a=rnd();
alpar@2483
    32
  check(a<1.0&&a>0.0,"This should be in [0,1)");
alpar@2483
    33
  a=rnd.gauss();
alpar@2483
    34
  a=rnd.gamma(3.45,0);
alpar@2483
    35
  a=rnd.gamma(4);
alpar@2483
    36
  //Does gamma work with integer k?
alpar@2483
    37
  a=rnd.gamma(4.0,0);
deba@2596
    38
deba@2596
    39
  lemon::rnd.seed(100);
deba@2596
    40
  lemon::rnd.seed(seed_array, seed_array + 
deba@2596
    41
		  (sizeof(seed_array) / sizeof(seed_array[0])));
deba@2596
    42
  return 0;
alpar@2483
    43
}