ladanyi@2647: #EXTRA_DIST += \
ladanyi@2647: #	test/preflow_graph.dim \
ladanyi@2647: #	test/dijkstra_test.lgf
ladanyi@2647: 
ladanyi@2647: #noinst_HEADERS += \
ladanyi@2647: #	test/test_tools.h \
ladanyi@2647: #	test/graph_test.h \
ladanyi@2647: #	test/map_test.h \
ladanyi@2647: #	test/graph_utils_test.h \
ladanyi@2647: #	test/heap_test.h
ladanyi@2647: 
ladanyi@2647: #check_PROGRAMS += \
ladanyi@2647: #	test/all_pairs_shortest_path_test \
ladanyi@2647: #	test/arborescence_test \
ladanyi@2647: #	test/bfs_test \
ladanyi@2647: #	test/bipartite_matching_test \
ladanyi@2647: #	test/counter_test \
ladanyi@2647: #	test/dfs_test \
ladanyi@2647: #	test/dijkstra_test \
ladanyi@2647: #	test/edge_set_test \
ladanyi@2647: #	test/graph_adaptor_test \
ladanyi@2647: #	test/graph_test \
ladanyi@2647: #	test/graph_utils_test \
ladanyi@2647: #	test/heap_test \
ladanyi@2647: #	test/kruskal_test \
ladanyi@2647: #	test/maps_test \
ladanyi@2647: #	test/matrix_maps_test \
ladanyi@2647: #	test/max_matching_test \
ladanyi@2647: #	test/min_cost_flow_test \
ladanyi@2647: #	test/path_test \
ladanyi@2647: #	test/polynomial_test \
ladanyi@2647: #	test/preflow_test \
ladanyi@2647: #	test/radix_sort_test \
ladanyi@2647: #	test/refptr_test \
ladanyi@2647: #	test/simann_test \
ladanyi@2647: #	test/suurballe_test \
ladanyi@2647: #	test/test_tools_fail \
ladanyi@2647: #	test/test_tools_pass \
ladanyi@2647: #	test/time_measure_test \
ladanyi@2647: #	test/ugraph_test \
ladanyi@2647: #	test/unionfind_test \
ladanyi@2647: #	test/xy_test
ladanyi@2647: 
ladanyi@2647: if HAVE_GLPK
ladanyi@2647: #check_PROGRAMS += test/lp_test
ladanyi@2647: else !HAVE_GLPK
ladanyi@2647: if HAVE_CPLEX
ladanyi@2647: #check_PROGRAMS += test/lp_test
ladanyi@2647: endif HAVE_CPLEX
ladanyi@2647: endif !HAVE_GLPK
ladanyi@2647: 
ladanyi@2647: TESTS += $(check_PROGRAMS)
ladanyi@2647: XFAIL_TESTS += test/test_tools_fail$(EXEEXT)
ladanyi@2647: 
ladanyi@2647: #test_all_pairs_shortest_path_test_SOURCES = test/all_pairs_shortest_path_test.cc
ladanyi@2647: #test_arborescence_test_SOURCES = test/arborescence_test.cc
ladanyi@2647: #test_bfs_test_SOURCES = test/bfs_test.cc
ladanyi@2647: #test_bipartite_matching_test_SOURCES = test/bipartite_matching_test.cc
ladanyi@2647: #test_counter_test_SOURCES = test/counter_test.cc
ladanyi@2647: #test_dfs_test_SOURCES = test/dfs_test.cc
ladanyi@2647: #test_dijkstra_test_SOURCES = test/dijkstra_test.cc
ladanyi@2647: #test_edge_set_test_SOURCES = test/edge_set_test.cc
ladanyi@2647: #test_graph_adaptor_test_SOURCES = test/graph_adaptor_test.cc
ladanyi@2647: #test_graph_test_SOURCES = test/graph_test.cc
ladanyi@2647: #test_graph_utils_test_SOURCES = test/graph_utils_test.cc
ladanyi@2647: #test_heap_test_SOURCES = test/heap_test.cc
ladanyi@2647: #test_kruskal_test_SOURCES = test/kruskal_test.cc
ladanyi@2647: #test_maps_test_SOURCES = test/maps_test.cc
ladanyi@2647: #test_matrix_maps_test_SOURCES = test/matrix_maps_test.cc
ladanyi@2647: #test_max_matching_test_SOURCES = test/max_matching_test.cc
ladanyi@2647: #test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc
ladanyi@2647: #test_path_test_SOURCES = test/path_test.cc
ladanyi@2647: #test_polynomial_test_SOURCES = test/polynomial_test.cc
ladanyi@2647: #test_preflow_test_SOURCES = test/preflow_test.cc
ladanyi@2647: #test_radix_sort_test_SOURCES = test/radix_sort_test.cc
ladanyi@2647: #test_refptr_test_SOURCES = test/refptr_test.cc
ladanyi@2647: #test_simann_test_SOURCES = test/simann_test.cc
ladanyi@2647: #test_suurballe_test_SOURCES = test/suurballe_test.cc
ladanyi@2647: #test_test_tools_fail_SOURCES = test/test_tools_fail.cc
ladanyi@2647: #test_test_tools_pass_SOURCES = test/test_tools_pass.cc
ladanyi@2647: #test_time_measure_test_SOURCES = test/time_measure_test.cc
ladanyi@2647: #test_ugraph_test_SOURCES = test/ugraph_test.cc
ladanyi@2647: #test_unionfind_test_SOURCES = test/unionfind_test.cc
ladanyi@2647: #test_xy_test_SOURCES = test/xy_test.cc
ladanyi@2647: 
ladanyi@2647: #test_lp_test_SOURCES = test/lp_test.cc
ladanyi@2647: #test_lp_test_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)