test/Makefile.am
author deba
Tue, 31 Jan 2006 19:33:48 +0000
changeset 1931 6abf67b02ff5
parent 1909 2d806130e700
child 1962 c1c3a0fae8a1
permissions -rw-r--r--
New iterable map with comparable values
it uses linked lists and balanced binary tree

IterableBoolMap has ItemIt type as the other iterable maps

InvertableMap got ValueIterator
deba@1711
     1
AM_CPPFLAGS = -I$(top_srcdir) -fno-inline
ladanyi@1435
     2
LDADD = $(top_builddir)/lemon/libemon.la
ladanyi@542
     3
alpar@1216
     4
EXTRA_DIST = preflow_graph.dim dijkstra_test.lgf
ladanyi@1349
     5
klao@946
     6
noinst_HEADERS = \
klao@946
     7
	test_tools.h \
klao@946
     8
	graph_test.h \
klao@946
     9
	map_test.h \
deba@1206
    10
	graph_utils_test.h \
deba@1206
    11
	heap_test.h
alpar@727
    12
deba@1901
    13
alpar@810
    14
check_PROGRAMS = \
deba@1711
    15
	all_pairs_shortest_path_test \
alpar@810
    16
	bfs_test \
alpar@1847
    17
	counter_test \
alpar@810
    18
	dfs_test \
alpar@810
    19
	dijkstra_test \
alpar@790
    20
	graph_test \
alpar@1401
    21
	graph_adaptor_test \
klao@946
    22
	graph_utils_test \
alpar@810
    23
	kruskal_test \
ladanyi@1349
    24
	maps_test \
deba@1728
    25
	matrix_maps_test \
deba@1901
    26
	max_matching_test \
alpar@899
    27
	min_cost_flow_test \
alpar@899
    28
	suurballe_test \
hegyi@820
    29
	path_test \
jacint@833
    30
	preflow_test \
deba@1833
    31
	radix_sort_test \
alpar@810
    32
	test_tools_fail \
alpar@810
    33
	test_tools_pass \
alpar@790
    34
	time_measure_test \
alpar@810
    35
	unionfind_test \
klao@1909
    36
	ugraph_test \
deba@1206
    37
	xy_test \
ladanyi@1921
    38
	heap_test \
ladanyi@1921
    39
	simann_test
alpar@790
    40
ladanyi@1349
    41
if HAVE_GLPK
ladanyi@1349
    42
check_PROGRAMS += lp_test
ladanyi@1387
    43
else !HAVE_GLPK
ladanyi@1387
    44
if HAVE_CPLEX
ladanyi@1387
    45
check_PROGRAMS += lp_test
ladanyi@1387
    46
endif HAVE_CPLEX
ladanyi@1387
    47
endif !HAVE_GLPK
ladanyi@1349
    48
ladanyi@542
    49
TESTS = $(check_PROGRAMS)
alpar@1235
    50
XFAIL_TESTS = test_tools_fail$(EXEEXT)
ladanyi@542
    51
deba@1711
    52
all_pairs_shortest_path_test_SOURCES = all_pairs_shortest_path_test.cc
alpar@774
    53
bfs_test_SOURCES = bfs_test.cc
alpar@1847
    54
counter_test_SOURCES = counter_test.cc
alpar@780
    55
dfs_test_SOURCES = dfs_test.cc
alpar@790
    56
dijkstra_test_SOURCES = dijkstra_test.cc
alpar@790
    57
graph_test_SOURCES = graph_test.cc
klao@946
    58
graph_utils_test_SOURCES = graph_utils_test.cc
alpar@1401
    59
graph_adaptor_test_SOURCES = graph_adaptor_test.cc
alpar@810
    60
kruskal_test_SOURCES = kruskal_test.cc
alpar@1041
    61
maps_test_SOURCES = maps_test.cc
deba@1728
    62
matrix_maps_test_SOURCES = matrix_maps_test.cc
alpar@899
    63
min_cost_flow_test_SOURCES = min_cost_flow_test.cc
jacint@1094
    64
max_matching_test_SOURCES = max_matching_test.cc
alpar@899
    65
suurballe_test_SOURCES = suurballe_test.cc
hegyi@820
    66
path_test_SOURCES = path_test.cc
deba@1833
    67
radix_sort_test_SOURCES = radix_sort_test.cc
jacint@833
    68
preflow_test_SOURCES = preflow_test.cc
alpar@790
    69
time_measure_test_SOURCES = time_measure_test.cc
alpar@790
    70
test_tools_fail_SOURCES = test_tools_fail.cc
alpar@790
    71
test_tools_pass_SOURCES = test_tools_pass.cc
alpar@774
    72
unionfind_test_SOURCES = unionfind_test.cc
alpar@727
    73
xy_test_SOURCES = xy_test.cc
klao@1909
    74
ugraph_test_SOURCES = ugraph_test.cc
deba@1206
    75
heap_test_SOURCES = heap_test.cc
ladanyi@1921
    76
simann_test_SOURCES = simann_test.cc
alpar@1324
    77
alpar@1324
    78
lp_test_SOURCES = lp_test.cc
ladanyi@1387
    79
lp_test_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)