test/Makefile.am
author deba
Fri, 31 Mar 2006 11:10:44 +0000
changeset 2025 93fcadf94ab0
parent 1977 8ef02f0c4245
child 2040 c7bd55c0d820
permissions -rw-r--r--
Bugfix in the minimum cost arborescence algorithm
Dual solution computation and interface for algorithm
Optimality test on random graph
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 \
deba@2025
    16
	arborescence_test \
alpar@810
    17
	bfs_test \
alpar@1847
    18
	counter_test \
alpar@810
    19
	dfs_test \
alpar@810
    20
	dijkstra_test \
deba@1962
    21
	edge_set_test \
alpar@790
    22
	graph_test \
alpar@1401
    23
	graph_adaptor_test \
klao@946
    24
	graph_utils_test \
alpar@810
    25
	kruskal_test \
ladanyi@1349
    26
	maps_test \
deba@1728
    27
	matrix_maps_test \
deba@1901
    28
	max_matching_test \
alpar@899
    29
	min_cost_flow_test \
alpar@899
    30
	suurballe_test \
hegyi@820
    31
	path_test \
jacint@833
    32
	preflow_test \
deba@1833
    33
	radix_sort_test \
alpar@1977
    34
	refptr_test \
alpar@810
    35
	test_tools_fail \
alpar@810
    36
	test_tools_pass \
alpar@790
    37
	time_measure_test \
alpar@810
    38
	unionfind_test \
klao@1909
    39
	ugraph_test \
deba@1206
    40
	xy_test \
ladanyi@1921
    41
	heap_test \
ladanyi@1921
    42
	simann_test
alpar@790
    43
ladanyi@1349
    44
if HAVE_GLPK
ladanyi@1349
    45
check_PROGRAMS += lp_test
ladanyi@1387
    46
else !HAVE_GLPK
ladanyi@1387
    47
if HAVE_CPLEX
ladanyi@1387
    48
check_PROGRAMS += lp_test
ladanyi@1387
    49
endif HAVE_CPLEX
ladanyi@1387
    50
endif !HAVE_GLPK
ladanyi@1349
    51
ladanyi@542
    52
TESTS = $(check_PROGRAMS)
alpar@1235
    53
XFAIL_TESTS = test_tools_fail$(EXEEXT)
ladanyi@542
    54
deba@1711
    55
all_pairs_shortest_path_test_SOURCES = all_pairs_shortest_path_test.cc
deba@2025
    56
arborescence_test_SOURCES = arborescence_test.cc
alpar@774
    57
bfs_test_SOURCES = bfs_test.cc
alpar@1847
    58
counter_test_SOURCES = counter_test.cc
alpar@780
    59
dfs_test_SOURCES = dfs_test.cc
alpar@790
    60
dijkstra_test_SOURCES = dijkstra_test.cc
deba@1962
    61
edge_set_test_SOURCES = edge_set_test.cc
alpar@790
    62
graph_test_SOURCES = graph_test.cc
klao@946
    63
graph_utils_test_SOURCES = graph_utils_test.cc
alpar@1401
    64
graph_adaptor_test_SOURCES = graph_adaptor_test.cc
alpar@810
    65
kruskal_test_SOURCES = kruskal_test.cc
alpar@1041
    66
maps_test_SOURCES = maps_test.cc
deba@1728
    67
matrix_maps_test_SOURCES = matrix_maps_test.cc
alpar@899
    68
min_cost_flow_test_SOURCES = min_cost_flow_test.cc
jacint@1094
    69
max_matching_test_SOURCES = max_matching_test.cc
alpar@899
    70
suurballe_test_SOURCES = suurballe_test.cc
hegyi@820
    71
path_test_SOURCES = path_test.cc
deba@1833
    72
radix_sort_test_SOURCES = radix_sort_test.cc
alpar@1977
    73
refptr_test_SOURCES = refptr_test.cc
jacint@833
    74
preflow_test_SOURCES = preflow_test.cc
alpar@790
    75
time_measure_test_SOURCES = time_measure_test.cc
alpar@790
    76
test_tools_fail_SOURCES = test_tools_fail.cc
alpar@790
    77
test_tools_pass_SOURCES = test_tools_pass.cc
alpar@774
    78
unionfind_test_SOURCES = unionfind_test.cc
alpar@727
    79
xy_test_SOURCES = xy_test.cc
klao@1909
    80
ugraph_test_SOURCES = ugraph_test.cc
deba@1206
    81
heap_test_SOURCES = heap_test.cc
ladanyi@1921
    82
simann_test_SOURCES = simann_test.cc
alpar@1324
    83
alpar@1324
    84
lp_test_SOURCES = lp_test.cc
ladanyi@1387
    85
lp_test_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)