test/random_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 806 fa6f37d7a25b
parent 209 765619b7cbb2
child 1163 db1d342a1087
permissions -rw-r--r--
Entirely rework CapacityScaling (#180)

- Use the new interface similarly to NetworkSimplex.
- Rework the implementation using an efficient internal structure
for handling the residual network. This improvement made the
code much faster (up to 2-5 times faster on large graphs).
- Handle GEQ supply type (LEQ is not supported).
- Handle negative costs for arcs of finite capacity.
(Note that this algorithm cannot handle arcs of negative cost
and infinite upper bound, thus it returns UNBOUNDED if such
an arc exists.)
- Extend the documentation.
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
}