test/test_tools_pass.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 806 fa6f37d7a25b
parent 209 765619b7cbb2
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@4
     2
 *
alpar@209
     3
 * This file is a part of LEMON, a generic C++ optimization library.
alpar@4
     4
 *
alpar@440
     5
 * Copyright (C) 2003-2009
alpar@4
     6
 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
alpar@4
     7
 * (Egervary Research Group on Combinatorial Optimization, EGRES).
alpar@4
     8
 *
alpar@4
     9
 * Permission to use, modify and distribute this software is granted
alpar@4
    10
 * provided that this copyright notice appears in all copies. For
alpar@4
    11
 * precise terms see the accompanying LICENSE file.
alpar@4
    12
 *
alpar@4
    13
 * This software is provided "AS IS" with no warranty of any kind,
alpar@4
    14
 * express or implied, and with no claim as to its suitability for any
alpar@4
    15
 * purpose.
alpar@4
    16
 *
alpar@4
    17
 */
alpar@4
    18
alpar@4
    19
#include "test_tools.h"
alpar@4
    20
alpar@209
    21
int main()
alpar@4
    22
{
alpar@4
    23
  check(true, "It should pass.");
alpar@4
    24
  return 0;
alpar@4
    25
}