test/random_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Fri, 17 Apr 2009 18:04:36 +0200
changeset 601 e6927fe719e6
parent 209 765619b7cbb2
permissions -rw-r--r--
Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
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
#include <lemon/random.h>
alpar@10
    20
#include "test_tools.h"
alpar@10
    21
deba@102
    22
int seed_array[] = {1, 2};
deba@102
    23
alpar@10
    24
int main()
alpar@10
    25
{
alpar@10
    26
  double a=lemon::rnd();
alpar@10
    27
  check(a<1.0&&a>0.0,"This should be in [0,1)");
alpar@10
    28
  a=lemon::rnd.gauss();
alpar@10
    29
  a=lemon::rnd.gamma(3.45,0);
alpar@10
    30
  a=lemon::rnd.gamma(4);
alpar@10
    31
  //Does gamma work with integer k?
alpar@10
    32
  a=lemon::rnd.gamma(4.0,0);
alpar@92
    33
  a=lemon::rnd.poisson(.5);
deba@102
    34
deba@102
    35
  lemon::rnd.seed(100);
alpar@209
    36
  lemon::rnd.seed(seed_array, seed_array +
alpar@209
    37
                  (sizeof(seed_array) / sizeof(seed_array[0])));
deba@102
    38
deba@102
    39
  return 0;
alpar@10
    40
}