Changeset 2649:68eaa3e9029d in lemon-0.x
- Timestamp:
- 07/04/06 13:58:39 (18 years ago)
- Branch:
- lemon-1.0
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/branches/lemon-1.0@2825
- Files:
-
- 4 added
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
Makefile.am
r2647 r2649 5 5 6 6 EXTRA_DIST = \ 7 LICENSE \8 lemon.spec \9 autopackage/default.apspec.in \10 7 m4/lx_check_cplex.m4 \ 11 8 m4/lx_check_glpk.m4 9 ## LICENSE \ 10 ## lemon.spec \ 11 ## autopackage/default.apspec.in 12 12 13 13 pkgconfigdir = $(libdir)/pkgconfig -
benchmark/Makefile.am
r2647 r2649 1 #noinst_HEADERS += benchmark/bench_tools.h 1 noinst_HEADERS += 2 ## benchmark/bench_tools.h 2 3 3 4 if WANT_BENCHMARK 4 5 5 #noinst_PROGRAMS += \ 6 # benchmark/graph-bench \7 # benchmark/hcube \8 # benchmark/swap_bipartite_bench \9 # benchmark/bfs-bench \10 # benchmark/radix_sort-bench \11 # benchmark/swap_bipartite_bench6 noinst_PROGRAMS += 7 ## benchmark/graph-bench \ 8 ## benchmark/hcube \ 9 ## benchmark/swap_bipartite_bench \ 10 ## benchmark/bfs-bench \ 11 ## benchmark/radix_sort-bench \ 12 ## benchmark/swap_bipartite_bench 12 13 13 14 endif WANT_BENCHMARK 14 15 15 # benchmark_graph_bench_SOURCES = benchmark/graph-bench.cc16 ##benchmark_graph_bench_SOURCES = benchmark/graph-bench.cc 16 17 17 # benchmark_hcube_SOURCES = benchmark/hcube.cc18 ##benchmark_hcube_SOURCES = benchmark/hcube.cc 18 19 19 # benchmark_bfs_bench_SOURCES = benchmark/bfs-bench.cc20 ##benchmark_bfs_bench_SOURCES = benchmark/bfs-bench.cc 20 21 21 # benchmark_radix_sort_bench_SOURCES = benchmark/radix_sort-bench.cc22 ##benchmark_radix_sort_bench_SOURCES = benchmark/radix_sort-bench.cc 22 23 23 # benchmark_swap_bipartite_bench_SOURCES = benchmark/swap_bipartite_bench.cc24 ##benchmark_swap_bipartite_bench_SOURCES = benchmark/swap_bipartite_bench.cc -
demo/Makefile.am
r2647 r2649 1 #EXTRA_DIST += demo/sub_graph_adaptor_demo.dim 1 EXTRA_DIST += 2 ## demo/sub_graph_adaptor_demo.dim 2 3 3 4 if WANT_DEMO 4 5 5 #noinst_PROGRAMS += \ 6 # demo/dim_to_dot \7 # demo/dijkstra_demo \8 # demo/reader_writer_demo \9 # demo/dim_to_lgf \10 # demo/eps_demo \11 # demo/graph_to_eps_demo \12 # demo/graph_orientation \13 # demo/min_route \14 # demo/hello_lemon \15 # demo/sub_graph_adaptor_demo \16 # demo/descriptor_map_demo \17 # demo/coloring \18 # demo/grid_ugraph_demo \19 # demo/topology_demo \20 # demo/simann_maxcut_demo \21 # demo/disjoint_paths_demo \22 # demo/strongly_connected_orientation6 noinst_PROGRAMS += 7 ## demo/dim_to_dot \ 8 ## demo/dijkstra_demo \ 9 ## demo/reader_writer_demo \ 10 ## demo/dim_to_lgf \ 11 ## demo/eps_demo \ 12 ## demo/graph_to_eps_demo \ 13 ## demo/graph_orientation \ 14 ## demo/min_route \ 15 ## demo/hello_lemon \ 16 ## demo/sub_graph_adaptor_demo \ 17 ## demo/descriptor_map_demo \ 18 ## demo/coloring \ 19 ## demo/grid_ugraph_demo \ 20 ## demo/topology_demo \ 21 ## demo/simann_maxcut_demo \ 22 ## demo/disjoint_paths_demo \ 23 ## demo/strongly_connected_orientation 23 24 24 25 if HAVE_GLPK 25 # noinst_PROGRAMS += demo/lp_demo demo/lp_maxflow_demo26 ##noinst_PROGRAMS += demo/lp_demo demo/lp_maxflow_demo 26 27 else !HAVE_GLPK 27 28 if HAVE_CPLEX 28 # noinst_PROGRAMS += demo/lp_demo demo/lp_maxflow_demo29 ##noinst_PROGRAMS += demo/lp_demo demo/lp_maxflow_demo 29 30 endif HAVE_CPLEX 30 31 endif !HAVE_GLPK … … 32 33 endif WANT_DEMO 33 34 34 # demo_dim_to_dot_SOURCES = demo/dim_to_dot.cc35 ##demo_dim_to_dot_SOURCES = demo/dim_to_dot.cc 35 36 36 # demo_dijkstra_demo_SOURCES = demo/dijkstra_demo.cc37 ##demo_dijkstra_demo_SOURCES = demo/dijkstra_demo.cc 37 38 38 # demo_eps_demo_SOURCES = demo/eps_demo.cc39 ##demo_eps_demo_SOURCES = demo/eps_demo.cc 39 40 40 # demo_reader_writer_demo_SOURCES = demo/reader_writer_demo.cc41 ##demo_reader_writer_demo_SOURCES = demo/reader_writer_demo.cc 41 42 42 # demo_dim_to_lgf_SOURCES = demo/dim_to_lgf.cc43 ##demo_dim_to_lgf_SOURCES = demo/dim_to_lgf.cc 43 44 44 # demo_coloring_SOURCES = demo/coloring.cc45 ##demo_coloring_SOURCES = demo/coloring.cc 45 46 46 # demo_graph_to_eps_demo_SOURCES = demo/graph_to_eps_demo.cc47 ##demo_graph_to_eps_demo_SOURCES = demo/graph_to_eps_demo.cc 47 48 48 # demo_grid_ugraph_demo_SOURCES = demo/grid_ugraph_demo.cc49 ##demo_grid_ugraph_demo_SOURCES = demo/grid_ugraph_demo.cc 49 50 50 # demo_graph_orientation_SOURCES = demo/graph_orientation.cc51 ##demo_graph_orientation_SOURCES = demo/graph_orientation.cc 51 52 52 # demo_min_route_SOURCES = demo/min_route.cc53 ##demo_min_route_SOURCES = demo/min_route.cc 53 54 54 # demo_hello_lemon_SOURCES = demo/hello_lemon.cc55 ##demo_hello_lemon_SOURCES = demo/hello_lemon.cc 55 56 56 # demo_sub_graph_adaptor_demo_SOURCES = \57 # demo/sub_graph_adaptor_demo.cc \58 # demo/tight_edge_filter_map.h57 ##demo_sub_graph_adaptor_demo_SOURCES = \ 58 ## demo/sub_graph_adaptor_demo.cc \ 59 ## demo/tight_edge_filter_map.h 59 60 60 # demo_lp_demo_SOURCES = demo/lp_demo.cc61 # demo_lp_demo_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)61 ##demo_lp_demo_SOURCES = demo/lp_demo.cc 62 ##demo_lp_demo_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS) 62 63 63 # demo_lp_maxflow_demo_SOURCES = demo/lp_maxflow_demo.cc64 # demo_lp_maxflow_demo_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)64 ##demo_lp_maxflow_demo_SOURCES = demo/lp_maxflow_demo.cc 65 ##demo_lp_maxflow_demo_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS) 65 66 66 # demo_descriptor_map_demo_SOURCES = demo/descriptor_map_demo.cc67 ##demo_descriptor_map_demo_SOURCES = demo/descriptor_map_demo.cc 67 68 68 # demo_topology_demo_SOURCES = demo/topology_demo.cc69 ##demo_topology_demo_SOURCES = demo/topology_demo.cc 69 70 70 # demo_simann_maxcut_demo_SOURCES = demo/simann_maxcut_demo.cc71 ##demo_simann_maxcut_demo_SOURCES = demo/simann_maxcut_demo.cc 71 72 72 # demo_disjoint_paths_demo_SOURCES = demo/disjoint_paths_demo.cc73 ##demo_disjoint_paths_demo_SOURCES = demo/disjoint_paths_demo.cc 73 74 74 # demo_strongly_connected_orientation_SOURCES = demo/strongly_connected_orientation.cc75 ##demo_strongly_connected_orientation_SOURCES = demo/strongly_connected_orientation.cc -
doc/Doxyfile.in
r2647 r2649 456 456 @abs_top_srcdir@/lemon/concept \ 457 457 @abs_top_srcdir@/demo \ 458 @abs_top_srcdir@/test/test_tools.h458 # @abs_top_srcdir@/test/test_tools.h 459 459 460 460 # If the value of the INPUT tag contains directories, you can use the -
doc/Makefile.am
r2647 r2649 2 2 3 3 EXTRA_DIST += \ 4 doc/html \5 doc/icons/geom/ftv2doc.png \6 doc/icons/geom/ftv2folderclosed.png \7 doc/icons/geom/ftv2folderopen.png \8 doc/coding_style.dox \9 doc/developers_interface.dox \10 doc/dirs.dox \11 doc/getstart.dox \12 doc/graph-adaptors.dox \13 doc/graph_io.dox \14 doc/graphs.dox \15 doc/groups.dox \16 doc/license.dox \17 doc/mainpage.dox \18 doc/maps.dox \19 doc/named-param.dox \20 doc/namespaces.dox \21 doc/quicktour.dox \22 doc/ugraphs.dox4 doc/html 5 ## doc/icons/geom/ftv2doc.png \ 6 ## doc/icons/geom/ftv2folderclosed.png \ 7 ## doc/icons/geom/ftv2folderopen.png \ 8 ## doc/coding_style.dox \ 9 ## doc/developers_interface.dox \ 10 ## doc/dirs.dox \ 11 ## doc/getstart.dox \ 12 ## doc/graph-adaptors.dox \ 13 ## doc/graph_io.dox \ 14 ## doc/graphs.dox \ 15 ## doc/groups.dox \ 16 ## doc/license.dox \ 17 ## doc/mainpage.dox \ 18 ## doc/maps.dox \ 19 ## doc/named-param.dox \ 20 ## doc/namespaces.dox \ 21 ## doc/quicktour.dox \ 22 ## doc/ugraphs.dox 23 23 24 24 doc: -
lemon/Makefile.am
r2647 r2649 1 1 pkgconfig_DATA += lemon/lemon.pc 2 2 3 #lib_LTLIBRARIES += lemon/libemon.la3 lib_LTLIBRARIES += lemon/libemon.la 4 4 5 #lemon_libemon_la_SOURCES = \ 6 # lemon/lp_base.cc \7 # lemon/lp_skeleton.cc \8 # lemon/base.cc \9 # lemon/eps.cc \10 # lemon/bits/mingw32_rand.cc \11 # lemon/bits/mingw32_time.cc5 lemon_libemon_la_SOURCES = 6 ## lemon/lp_base.cc \ 7 ## lemon/lp_skeleton.cc \ 8 ## lemon/base.cc \ 9 ## lemon/eps.cc \ 10 ## lemon/bits/mingw32_rand.cc \ 11 ## lemon/bits/mingw32_time.cc 12 12 13 #lemon_libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)14 #lemon_libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS)13 lemon_libemon_la_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS) 14 lemon_libemon_la_LDFLAGS = $(GLPK_LIBS) $(CPLEX_LIBS) 15 15 16 16 if HAVE_GLPK 17 # lemon_libemon_la_SOURCES += lemon/lp_glpk.cc17 ##lemon_libemon_la_SOURCES += lemon/lp_glpk.cc 18 18 endif 19 19 20 20 if HAVE_CPLEX 21 # lemon_libemon_la_SOURCES += lemon/lp_cplex.cc21 ##lemon_libemon_la_SOURCES += lemon/lp_cplex.cc 22 22 endif 23 23 24 #lemon_HEADERS += \ 25 # lemon/bellman_ford.h \26 # lemon/bezier.h \27 # lemon/bfs.h \28 # lemon/bin_heap.h \29 # lemon/bipartite_matching.h \30 # lemon/bpugraph_adaptor.h \31 # lemon/bucket_heap.h \32 # lemon/color.h \33 # lemon/config.h \34 # lemon/counter.h \35 # lemon/dag_shortest_path.h \36 # lemon/dfs.h \37 # lemon/dijkstra.h \38 # lemon/dimacs.h \39 # lemon/edge_set.h \40 # lemon/edmonds_karp.h \41 # lemon/eps.h \42 # lemon/error.h \43 # lemon/fib_heap.h \44 # lemon/floyd_warshall.h \45 # lemon/fredman_tarjan.h \46 # lemon/full_graph.h \47 # lemon/graph_adaptor.h \48 # lemon/graph_reader.h \49 # lemon/graph_to_eps.h \50 # lemon/graph_utils.h \51 # lemon/graph_writer.h \52 # lemon/grid_ugraph.h \53 # lemon/hypercube_graph.h \54 # lemon/iterable_maps.h \55 # lemon/johnson.h \56 # lemon/kruskal.h \57 # lemon/lemon_reader.h \58 # lemon/lemon_writer.h \59 # lemon/list_graph.h \60 # lemon/lp.h \61 # lemon/lp_base.h \62 # lemon/lp_cplex.h \63 # lemon/lp_glpk.h \64 # lemon/lp_skeleton.h \65 # lemon/map_iterator.h \66 # lemon/maps.h \67 # lemon/matrix_maps.h \68 # lemon/max_matching.h \69 # lemon/min_cost_arborescence.h \70 # lemon/min_cost_flow.h \71 # lemon/min_cut.h \72 # lemon/path.h \73 # lemon/polynomial.h \74 # lemon/preflow.h \75 # lemon/prim.h \76 # lemon/radix_heap.h \77 # lemon/radix_sort.h \78 # lemon/refptr.h \79 # lemon/simann.h \80 # lemon/smart_graph.h \81 # lemon/sub_graph.h \82 # lemon/suurballe.h \83 # lemon/tabu_search.h \84 # lemon/time_measure.h \85 # lemon/tolerance.h \86 # lemon/topology.h \87 # lemon/ugraph_adaptor.h \88 # lemon/unionfind.h \89 # lemon/xy.h24 lemon_HEADERS += 25 ## lemon/bellman_ford.h \ 26 ## lemon/bezier.h \ 27 ## lemon/bfs.h \ 28 ## lemon/bin_heap.h \ 29 ## lemon/bipartite_matching.h \ 30 ## lemon/bpugraph_adaptor.h \ 31 ## lemon/bucket_heap.h \ 32 ## lemon/color.h \ 33 ## lemon/config.h \ 34 ## lemon/counter.h \ 35 ## lemon/dag_shortest_path.h \ 36 ## lemon/dfs.h \ 37 ## lemon/dijkstra.h \ 38 ## lemon/dimacs.h \ 39 ## lemon/edge_set.h \ 40 ## lemon/edmonds_karp.h \ 41 ## lemon/eps.h \ 42 ## lemon/error.h \ 43 ## lemon/fib_heap.h \ 44 ## lemon/floyd_warshall.h \ 45 ## lemon/fredman_tarjan.h \ 46 ## lemon/full_graph.h \ 47 ## lemon/graph_adaptor.h \ 48 ## lemon/graph_reader.h \ 49 ## lemon/graph_to_eps.h \ 50 ## lemon/graph_utils.h \ 51 ## lemon/graph_writer.h \ 52 ## lemon/grid_ugraph.h \ 53 ## lemon/hypercube_graph.h \ 54 ## lemon/iterable_maps.h \ 55 ## lemon/johnson.h \ 56 ## lemon/kruskal.h \ 57 ## lemon/lemon_reader.h \ 58 ## lemon/lemon_writer.h \ 59 ## lemon/list_graph.h \ 60 ## lemon/lp.h \ 61 ## lemon/lp_base.h \ 62 ## lemon/lp_cplex.h \ 63 ## lemon/lp_glpk.h \ 64 ## lemon/lp_skeleton.h \ 65 ## lemon/map_iterator.h \ 66 ## lemon/maps.h \ 67 ## lemon/matrix_maps.h \ 68 ## lemon/max_matching.h \ 69 ## lemon/min_cost_arborescence.h \ 70 ## lemon/min_cost_flow.h \ 71 ## lemon/min_cut.h \ 72 ## lemon/path.h \ 73 ## lemon/polynomial.h \ 74 ## lemon/preflow.h \ 75 ## lemon/prim.h \ 76 ## lemon/radix_heap.h \ 77 ## lemon/radix_sort.h \ 78 ## lemon/refptr.h \ 79 ## lemon/simann.h \ 80 ## lemon/smart_graph.h \ 81 ## lemon/sub_graph.h \ 82 ## lemon/suurballe.h \ 83 ## lemon/tabu_search.h \ 84 ## lemon/time_measure.h \ 85 ## lemon/tolerance.h \ 86 ## lemon/topology.h \ 87 ## lemon/ugraph_adaptor.h \ 88 ## lemon/unionfind.h \ 89 ## lemon/xy.h 90 90 91 #bits_HEADERS += \ 92 # lemon/bits/alteration_notifier.h \93 # lemon/bits/array_map.h \94 # lemon/bits/base_extender.h \95 # lemon/bits/default_map.h \96 # lemon/bits/edge_set_extender.h \97 # lemon/bits/graph_adaptor_extender.h \98 # lemon/bits/graph_extender.h \99 # lemon/bits/invalid.h \100 # lemon/bits/item_reader.h \101 # lemon/bits/item_writer.h \102 # lemon/bits/map_extender.h \103 # lemon/bits/mingw32_rand.h \104 # lemon/bits/mingw32_time.h \105 # lemon/bits/traits.h \106 # lemon/bits/utility.h \107 # lemon/bits/vector_map.h91 bits_HEADERS += 92 ## lemon/bits/alteration_notifier.h \ 93 ## lemon/bits/array_map.h \ 94 ## lemon/bits/base_extender.h \ 95 ## lemon/bits/default_map.h \ 96 ## lemon/bits/edge_set_extender.h \ 97 ## lemon/bits/graph_adaptor_extender.h \ 98 ## lemon/bits/graph_extender.h \ 99 ## lemon/bits/invalid.h \ 100 ## lemon/bits/item_reader.h \ 101 ## lemon/bits/item_writer.h \ 102 ## lemon/bits/map_extender.h \ 103 ## lemon/bits/mingw32_rand.h \ 104 ## lemon/bits/mingw32_time.h \ 105 ## lemon/bits/traits.h \ 106 ## lemon/bits/utility.h \ 107 ## lemon/bits/vector_map.h 108 108 109 #concept_HEADERS += \ 110 # lemon/concept_check.h \111 # lemon/concept/bpugraph.h \112 # lemon/concept/graph.h \113 # lemon/concept/graph_component.h \114 # lemon/concept/heap.h \115 # lemon/concept/maps.h \116 # lemon/concept/matrix_maps.h \117 # lemon/concept/path.h \118 # lemon/concept/ugraph.h109 concept_HEADERS += 110 ## lemon/concept_check.h \ 111 ## lemon/concept/bpugraph.h \ 112 ## lemon/concept/graph.h \ 113 ## lemon/concept/graph_component.h \ 114 ## lemon/concept/heap.h \ 115 ## lemon/concept/maps.h \ 116 ## lemon/concept/matrix_maps.h \ 117 ## lemon/concept/path.h \ 118 ## lemon/concept/ugraph.h -
test/Makefile.am
r2647 r2649 1 # EXTRA_DIST += \2 # test/preflow_graph.dim \3 # test/dijkstra_test.lgf1 ##EXTRA_DIST += 2 ## test/preflow_graph.dim \ 3 ## test/dijkstra_test.lgf 4 4 5 #noinst_HEADERS += \ 6 # test/test_tools.h \7 # test/graph_test.h \8 # test/map_test.h \9 # test/graph_utils_test.h \10 # test/heap_test.h5 noinst_HEADERS += 6 ## test/test_tools.h \ 7 ## test/graph_test.h \ 8 ## test/map_test.h \ 9 ## test/graph_utils_test.h \ 10 ## test/heap_test.h 11 11 12 #check_PROGRAMS += \ 13 # test/all_pairs_shortest_path_test \14 # test/arborescence_test \15 # test/bfs_test \16 # test/bipartite_matching_test \17 # test/counter_test \18 # test/dfs_test \19 # test/dijkstra_test \20 # test/edge_set_test \21 # test/graph_adaptor_test \22 # test/graph_test \23 # test/graph_utils_test \24 # test/heap_test \25 # test/kruskal_test \26 # test/maps_test \27 # test/matrix_maps_test \28 # test/max_matching_test \29 # test/min_cost_flow_test \30 # test/path_test \31 # test/polynomial_test \32 # test/preflow_test \33 # test/radix_sort_test \34 # test/refptr_test \35 # test/simann_test \36 # test/suurballe_test \37 # test/test_tools_fail \38 # test/test_tools_pass \39 # test/time_measure_test \40 # test/ugraph_test \41 # test/unionfind_test \42 # test/xy_test12 check_PROGRAMS += 13 ## test/all_pairs_shortest_path_test \ 14 ## test/arborescence_test \ 15 ## test/bfs_test \ 16 ## test/bipartite_matching_test \ 17 ## test/counter_test \ 18 ## test/dfs_test \ 19 ## test/dijkstra_test \ 20 ## test/edge_set_test \ 21 ## test/graph_adaptor_test \ 22 ## test/graph_test \ 23 ## test/graph_utils_test \ 24 ## test/heap_test \ 25 ## test/kruskal_test \ 26 ## test/maps_test \ 27 ## test/matrix_maps_test \ 28 ## test/max_matching_test \ 29 ## test/min_cost_flow_test \ 30 ## test/path_test \ 31 ## test/polynomial_test \ 32 ## test/preflow_test \ 33 ## test/radix_sort_test \ 34 ## test/refptr_test \ 35 ## test/simann_test \ 36 ## test/suurballe_test \ 37 ## test/test_tools_fail \ 38 ## test/test_tools_pass \ 39 ## test/time_measure_test \ 40 ## test/ugraph_test \ 41 ## test/unionfind_test \ 42 ## test/xy_test 43 43 44 44 if HAVE_GLPK 45 # check_PROGRAMS += test/lp_test45 ##check_PROGRAMS += test/lp_test 46 46 else !HAVE_GLPK 47 47 if HAVE_CPLEX 48 # check_PROGRAMS += test/lp_test48 ##check_PROGRAMS += test/lp_test 49 49 endif HAVE_CPLEX 50 50 endif !HAVE_GLPK … … 53 53 XFAIL_TESTS += test/test_tools_fail$(EXEEXT) 54 54 55 # test_all_pairs_shortest_path_test_SOURCES = test/all_pairs_shortest_path_test.cc56 # test_arborescence_test_SOURCES = test/arborescence_test.cc57 # test_bfs_test_SOURCES = test/bfs_test.cc58 # test_bipartite_matching_test_SOURCES = test/bipartite_matching_test.cc59 # test_counter_test_SOURCES = test/counter_test.cc60 # test_dfs_test_SOURCES = test/dfs_test.cc61 # test_dijkstra_test_SOURCES = test/dijkstra_test.cc62 # test_edge_set_test_SOURCES = test/edge_set_test.cc63 # test_graph_adaptor_test_SOURCES = test/graph_adaptor_test.cc64 # test_graph_test_SOURCES = test/graph_test.cc65 # test_graph_utils_test_SOURCES = test/graph_utils_test.cc66 # test_heap_test_SOURCES = test/heap_test.cc67 # test_kruskal_test_SOURCES = test/kruskal_test.cc68 # test_maps_test_SOURCES = test/maps_test.cc69 # test_matrix_maps_test_SOURCES = test/matrix_maps_test.cc70 # test_max_matching_test_SOURCES = test/max_matching_test.cc71 # test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc72 # test_path_test_SOURCES = test/path_test.cc73 # test_polynomial_test_SOURCES = test/polynomial_test.cc74 # test_preflow_test_SOURCES = test/preflow_test.cc75 # test_radix_sort_test_SOURCES = test/radix_sort_test.cc76 # test_refptr_test_SOURCES = test/refptr_test.cc77 # test_simann_test_SOURCES = test/simann_test.cc78 # test_suurballe_test_SOURCES = test/suurballe_test.cc79 # test_test_tools_fail_SOURCES = test/test_tools_fail.cc80 # test_test_tools_pass_SOURCES = test/test_tools_pass.cc81 # test_time_measure_test_SOURCES = test/time_measure_test.cc82 # test_ugraph_test_SOURCES = test/ugraph_test.cc83 # test_unionfind_test_SOURCES = test/unionfind_test.cc84 # test_xy_test_SOURCES = test/xy_test.cc55 ##test_all_pairs_shortest_path_test_SOURCES = test/all_pairs_shortest_path_test.cc 56 ##test_arborescence_test_SOURCES = test/arborescence_test.cc 57 ##test_bfs_test_SOURCES = test/bfs_test.cc 58 ##test_bipartite_matching_test_SOURCES = test/bipartite_matching_test.cc 59 ##test_counter_test_SOURCES = test/counter_test.cc 60 ##test_dfs_test_SOURCES = test/dfs_test.cc 61 ##test_dijkstra_test_SOURCES = test/dijkstra_test.cc 62 ##test_edge_set_test_SOURCES = test/edge_set_test.cc 63 ##test_graph_adaptor_test_SOURCES = test/graph_adaptor_test.cc 64 ##test_graph_test_SOURCES = test/graph_test.cc 65 ##test_graph_utils_test_SOURCES = test/graph_utils_test.cc 66 ##test_heap_test_SOURCES = test/heap_test.cc 67 ##test_kruskal_test_SOURCES = test/kruskal_test.cc 68 ##test_maps_test_SOURCES = test/maps_test.cc 69 ##test_matrix_maps_test_SOURCES = test/matrix_maps_test.cc 70 ##test_max_matching_test_SOURCES = test/max_matching_test.cc 71 ##test_min_cost_flow_test_SOURCES = test/min_cost_flow_test.cc 72 ##test_path_test_SOURCES = test/path_test.cc 73 ##test_polynomial_test_SOURCES = test/polynomial_test.cc 74 ##test_preflow_test_SOURCES = test/preflow_test.cc 75 ##test_radix_sort_test_SOURCES = test/radix_sort_test.cc 76 ##test_refptr_test_SOURCES = test/refptr_test.cc 77 ##test_simann_test_SOURCES = test/simann_test.cc 78 ##test_suurballe_test_SOURCES = test/suurballe_test.cc 79 ##test_test_tools_fail_SOURCES = test/test_tools_fail.cc 80 ##test_test_tools_pass_SOURCES = test/test_tools_pass.cc 81 ##test_time_measure_test_SOURCES = test/time_measure_test.cc 82 ##test_ugraph_test_SOURCES = test/ugraph_test.cc 83 ##test_unionfind_test_SOURCES = test/unionfind_test.cc 84 ##test_xy_test_SOURCES = test/xy_test.cc 85 85 86 # test_lp_test_SOURCES = test/lp_test.cc87 # test_lp_test_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)86 ##test_lp_test_SOURCES = test/lp_test.cc 87 ##test_lp_test_CXXFLAGS = $(GLPK_CFLAGS) $(CPLEX_CFLAGS)
Note: See TracChangeset
for help on using the changeset viewer.