ceph/src/boost/libs/graph/test/Jamfile.v2

   1 # Copyright (c) 2002 Trustees of Indiana University
   2 #
   3 # Distributed under the Boost Software License, Version 1.0.
   4 # (See accompanying file LICENSE_1_0.txt or copy at
   5 # http://www.boost.org/LICENSE_1_0.txt)
   6
   7 # Define SGB (stanford graph base top level directory) and
   8 # LEDA (also top level directory) at the command line of jam using -s
   9
  10 import modules ;
  11 import path ;
  12
  13 path-constant TEST_DIR : . ;
  14
  15 path-constant PLANAR_INPUT_FILES : ./planar_input_graphs ;
  16
  17 path-constant CYCLE_RATIO_INPUT_FILE : ./cycle_ratio_s382.90.dot ;
  18
  19 path-constant METIS_INPUT_FILE : ./weighted_graph.gr ;
  20
  21 test-suite graph_test :
  22     # test_graphs will eventually defined a framework for testing the structure
  23     # and implementation of graph data structures and adaptors.
  24     [ run test_graphs.cpp ]
  25     [ run index_graph.cpp ]     # TODO: Make this part of the test_graphs framework
  26     [ run labeled_graph.cpp ]
  27     [ run finish_edge_bug.cpp ]
  28
  29     [ run transitive_closure_test.cpp ]
  30     [ compile adj_list_cc.cpp ]
  31
  32     # adj_list_test needs some work -JGS
  33     # unit-test adj_list_test : adj_list_test.cpp  ;
  34
  35     [ run adj_list_edge_list_set.cpp ]
  36     [ run adj_list_loops.cpp ]
  37     [ compile adj_matrix_cc.cpp ]
  38     [ run bfs.cpp ../../test/build//boost_test_exec_monitor ]
  39     [ compile bfs_cc.cpp ]
  40     [ run bellman-test.cpp ]
  41     [ run betweenness_centrality_test.cpp : 100 ]
  42     [ run bidir_remove_edge.cpp ]
  43     [ run bipartite_test.cpp ]
  44     # [ run csr_graph_test.cpp : : : : : <variant>release ]
  45     [ run dag_longest_paths.cpp ]
  46     [ run dfs.cpp ../../test/build//boost_test_exec_monitor ]
  47     [ run undirected_dfs.cpp ../../test/build//boost_test_exec_monitor ]
  48     [ compile dfs_cc.cpp ]
  49     [ compile dijkstra_cc.cpp ]
  50     [ run dijkstra_heap_performance.cpp : 10000 ]
  51     [ run dijkstra_no_color_map_compare.cpp : 10000 ]
  52     [ run dominator_tree_test.cpp ]
  53     [ run relaxed_heap_test.cpp : 5000 15000 ]
  54     [ compile edge_list_cc.cpp ]
  55     [ compile filtered_graph_cc.cpp ]
  56     [ run generator_test.cpp ]
  57     [ run graph.cpp ]
  58     [ compile graph_concepts.cpp ]
  59     [ run graphviz_test.cpp
  60             /boost/test//boost_test_exec_monitor/<link>static
  61             ../build//boost_graph
  62             ../../regex/build//boost_regex : --log_level=all ]
  63     [ run metis_test.cpp : $(METIS_INPUT_FILE) ]
  64     [ run gursoy_atun_layout_test.cpp ]
  65     [ run layout_test.cpp : : : <test-info>always_show_run_output <toolset>intel:<debug-symbols>off ]
  66
  67     [ run serialize.cpp
  68           ../../serialization/build//boost_serialization
  69       : : : ]
  70
  71     [ compile reverse_graph_cc.cpp ]
  72     [ run sequential_vertex_coloring.cpp ]
  73
  74     # TODO: Merge these into a single test framework.
  75     [ run subgraph.cpp ../../test/build//boost_test_exec_monitor ]
  76     [ run subgraph_bundled.cpp ]
  77     [ run subgraph_props.cpp ]
  78
  79     [ run isomorphism.cpp ../../test/build//boost_test_exec_monitor ]
  80     [ run adjacency_matrix_test.cpp ]
  81     [ compile vector_graph_cc.cpp ]
  82     [ compile copy.cpp ]
  83     [ compile swap.cpp ]
  84     [ compile property_iter.cpp ]
  85     [ run bundled_properties.cpp ]
  86     [ run floyd_warshall_test.cpp ]
  87     [ run astar_search_test.cpp ]
  88     [ run biconnected_components_test.cpp ]
  89     [ run cuthill_mckee_ordering.cpp ]
  90     [ run king_ordering.cpp ]
  91     [ run matching_test.cpp ]
  92     [ run max_flow_test.cpp ]
  93     [ run boykov_kolmogorov_max_flow_test.cpp ]
  94     [ run cycle_ratio_tests.cpp ../build//boost_graph ../../regex/build//boost_regex : $(CYCLE_RATIO_INPUT_FILE) ]
  95     [ run basic_planarity_test.cpp ]
  96     [ run make_connected_test.cpp ]
  97     [ run make_bicon_planar_test.cpp ]
  98     [ run make_maximal_planar_test.cpp ]
  99     [ run named_vertices_test.cpp ]
 100     [ run all_planar_input_files_test.cpp
 101         ../../filesystem/build
 102         ../../system/build
 103         : $(PLANAR_INPUT_FILES) ]
 104     [ run parallel_edges_loops_test.cpp
 105         ../../filesystem/build
 106         ../../system/build
 107         : $(PLANAR_INPUT_FILES) ]
 108     [ run r_c_shortest_paths_test.cpp ]
 109     [ run rcsp_custom_vertex_id.cpp ]
 110     [ run is_straight_line_draw_test.cpp ]
 111     [ run metric_tsp_approx.cpp : metric_tsp_approx.graph ]
 112     [ compile dimacs.cpp ]
 113     [ run bron_kerbosch_all_cliques.cpp ]
 114     [ run tiernan_all_cycles.cpp ]
 115     [ run closeness_centrality.cpp ]
 116     [ run degree_centrality.cpp ]
 117     [ run mean_geodesic.cpp ]
 118     [ run eccentricity.cpp ]
 119     [ run clustering_coefficient.cpp ]
 120     [ run core_numbers_test.cpp ]
 121     [ run read_propmap.cpp ]
 122     [ run mcgregor_subgraphs_test.cpp ../build//boost_graph ]
 123     [ compile grid_graph_cc.cpp ]
 124     [ run grid_graph_test.cpp ]
 125     [ run incremental_components_test.cpp ]
 126     [ run two_graphs_common_spanning_trees_test.cpp ]
 127     [ run random_spanning_tree_test.cpp ../build//boost_graph ]
 128     [ run graphml_test.cpp ../build//boost_graph : : "graphml_test.xml" ]
 129     [ run mas_test.cpp ../../test/build//boost_unit_test_framework/<link>static : $(TEST_DIR) ]
 130     [ run stoer_wagner_test.cpp ../../test/build//boost_unit_test_framework/<link>static : $(TEST_DIR) ]
 131     [ compile filtered_graph_properties_dijkstra.cpp ]
 132     [ run vf2_sub_graph_iso_test.cpp ]
 133     [ run vf2_sub_graph_iso_test_2.cpp ]
 134     [ run hawick_circuits.cpp ]
 135     [ run successive_shortest_path_nonnegative_weights_test.cpp ../../test/build//boost_unit_test_framework/<link>static ]
 136     [ run cycle_canceling_test.cpp ../../test/build//boost_unit_test_framework/<link>static ]
 137     [ run strong_components_test.cpp ]
 138     [ run find_flow_cost_bundled_properties_and_named_params_test.cpp ../../test/build//boost_unit_test_framework/<link>static ]
 139     [ run max_flow_algorithms_bundled_properties_and_named_params.cpp ../../test/build//boost_unit_test_framework/<link>static ]
 140     ;
 141
 142 # Run SDB tests only when -sSDB= is set.
 143 local SDB = [ modules.peek : SDB ] ;
 144 if $(SDB)
 145 {
 146     local sdb-root = [ path.root [ path.make $(SDB) ] [ path.pwd ] ] ;
 147
 148     compile stanford_graph_cc.cpp :
 149         <include>$(sdb-root) ;
 150 }
 151
 152 # Run LEDA tests only when -sLEDA= is set.
 153 local LEDA = [ modules.peek : LEDA ] ;
 154 if $(LEDA)
 155 {
 156     local leda-root = [ path.root [ path.make $(LEDA) ] [ path.pwd ] ] ;
 157     local leda-include = [ path.join $(leda-root) incl ] ;
 158
 159     compile leda_graph_cc.cpp :
 160         <include>$(leda-include) ;
 161 }