test/Makefile.am
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 12 Nov 2009 23:26:13 +0100
changeset 806 fa6f37d7a25b
parent 770 432c54cec63c
child 799 6be1f9bd2ac0
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.
ladanyi@793
     1
if USE_VALGRIND
ladanyi@793
     2
TESTS_ENVIRONMENT=$(top_srcdir)/scripts/valgrind-wrapper.sh
ladanyi@793
     3
endif
ladanyi@793
     4
ladanyi@1
     5
EXTRA_DIST += \
deba@228
     6
	test/CMakeLists.txt
ladanyi@1
     7
alpar@4
     8
noinst_HEADERS += \
kpeter@171
     9
	test/graph_test.h \
alpar@440
    10
	test/test_tools.h
alpar@10
    11
alpar@4
    12
check_PROGRAMS += \
kpeter@465
    13
	test/adaptors_test \
kpeter@698
    14
	test/bellman_ford_test \
alpar@100
    15
	test/bfs_test \
alpar@440
    16
	test/circulation_test \
kpeter@649
    17
	test/connectivity_test \
alpar@440
    18
	test/counter_test \
alpar@100
    19
	test/dfs_test \
deba@57
    20
	test/digraph_test \
kpeter@170
    21
	test/dijkstra_test \
alpar@440
    22
	test/dim_test \
deba@468
    23
	test/edge_set_test \
deba@108
    24
	test/error_test \
ladanyi@522
    25
	test/euler_test \
tapolcai@543
    26
	test/gomory_hu_test \
deba@200
    27
	test/graph_copy_test \
deba@57
    28
	test/graph_test \
deba@139
    29
	test/graph_utils_test \
alpar@424
    30
	test/hao_orlin_test \
deba@203
    31
	test/heap_test \
alpar@103
    32
	test/kruskal_test \
alpar@440
    33
	test/maps_test \
kpeter@594
    34
	test/matching_test \
deba@490
    35
	test/min_cost_arborescence_test \
kpeter@601
    36
	test/min_cost_flow_test \
kpeter@763
    37
	test/min_mean_cycle_test \
alpar@440
    38
	test/path_test \
alpar@440
    39
	test/preflow_test \
deba@441
    40
	test/radix_sort_test \
alpar@440
    41
	test/random_test \
alpar@440
    42
	test/suurballe_test \
alpar@440
    43
	test/test_tools_fail \
alpar@440
    44
	test/test_tools_pass \
alpar@440
    45
	test/time_measure_test \
alpar@103
    46
	test/unionfind_test
alpar@10
    47
ladanyi@564
    48
test_test_tools_pass_DEPENDENCIES = demo
ladanyi@564
    49
deba@458
    50
if HAVE_LP
deba@458
    51
check_PROGRAMS += test/lp_test
deba@458
    52
endif HAVE_LP
deba@458
    53
if HAVE_MIP
deba@458
    54
check_PROGRAMS += test/mip_test
deba@458
    55
endif HAVE_MIP
deba@458
    56
ladanyi@1
    57
TESTS += $(check_PROGRAMS)
ladanyi@1
    58
XFAIL_TESTS += test/test_tools_fail$(EXEEXT)
alpar@4
    59
kpeter@465
    60
test_adaptors_test_SOURCES = test/adaptors_test.cc
kpeter@698
    61
test_bellman_ford_test_SOURCES = test/bellman_ford_test.cc
alpar@100
    62
test_bfs_test_SOURCES = test/bfs_test.cc
alpar@400
    63
test_circulation_test_SOURCES = test/circulation_test.cc
alpar@119
    64
test_counter_test_SOURCES = test/counter_test.cc
kpeter@649
    65
test_connectivity_test_SOURCES = test/connectivity_test.cc
alpar@100
    66
test_dfs_test_SOURCES = test/dfs_test.cc
deba@57
    67
test_digraph_test_SOURCES = test/digraph_test.cc
kpeter@170
    68
test_dijkstra_test_SOURCES = test/dijkstra_test.cc
alpar@8
    69
test_dim_test_SOURCES = test/dim_test.cc
deba@468
    70
test_edge_set_test_SOURCES = test/edge_set_test.cc
deba@108
    71
test_error_test_SOURCES = test/error_test.cc
ladanyi@522
    72
test_euler_test_SOURCES = test/euler_test.cc
tapolcai@543
    73
test_gomory_hu_test_SOURCES = test/gomory_hu_test.cc
deba@200
    74
test_graph_copy_test_SOURCES = test/graph_copy_test.cc
deba@57
    75
test_graph_test_SOURCES = test/graph_test.cc
deba@139
    76
test_graph_utils_test_SOURCES = test/graph_utils_test.cc
deba@203
    77
test_heap_test_SOURCES = test/heap_test.cc
alpar@103
    78
test_kruskal_test_SOURCES = test/kruskal_test.cc
deba@410
    79
test_hao_orlin_test_SOURCES = test/hao_orlin_test.cc
deba@458
    80
test_lp_test_SOURCES = test/lp_test.cc
alpar@25
    81
test_maps_test_SOURCES = test/maps_test.cc
deba@458
    82
test_mip_test_SOURCES = test/mip_test.cc
kpeter@594
    83
test_matching_test_SOURCES = test/matching_test.cc
deba@490
    84
test_min_cost_arborescence_test_SOURCES = test/min_cost_arborescence_test.cc
kpeter@601
    85
test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc
kpeter@763
    86
test_min_mean_cycle_test_SOURCES = test/min_mean_cycle_test.cc
alpar@96
    87
test_path_test_SOURCES = test/path_test.cc
alpar@389
    88
test_preflow_test_SOURCES = test/preflow_test.cc
deba@441
    89
test_radix_sort_test_SOURCES = test/radix_sort_test.cc
alpar@345
    90
test_suurballe_test_SOURCES = test/suurballe_test.cc
alpar@10
    91
test_random_test_SOURCES = test/random_test.cc
alpar@4
    92
test_test_tools_fail_SOURCES = test/test_tools_fail.cc
alpar@4
    93
test_test_tools_pass_SOURCES = test/test_tools_pass.cc
alpar@119
    94
test_time_measure_test_SOURCES = test/time_measure_test.cc
alpar@103
    95
test_unionfind_test_SOURCES = test/unionfind_test.cc