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

   1 # Copyright (C) 2007-2009 Andrew Sutton
   2 #
   3 # Distributed under the Boost Software License, Version 1.0. (See accompanying
   4 # file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
   5
   6
   7 exe accum-compile-times : accum-compile-times.cpp ;
   8 exe actor_clustering : actor_clustering.cpp ;
   9 exe adjacency_list : adjacency_list.cpp ;
  10 exe adjacency_list_io : adjacency_list_io.cpp ;
  11 exe adjacency_matrix : adjacency_matrix.cpp ;
  12 exe adj_list_ra_edgelist : adj_list_ra_edgelist.cpp ;
  13 exe astar-cities : astar-cities.cpp ;
  14 exe astar_maze : astar_maze.cpp ;
  15 exe bellman-example : bellman-example.cpp ;
  16 exe bellman-ford-internet : bellman-ford-internet.cpp ;
  17 exe bfs : bfs.cpp ;
  18 exe bfs-example2 : bfs-example2.cpp ;
  19 exe bfs-example : bfs-example.cpp ;
  20 exe bfs-name-printer : bfs-name-printer.cpp ;
  21 exe bfs_neighbor : bfs_neighbor.cpp ;
  22 exe bipartite_example : bipartite_example.cpp ;
  23 exe biconnected_components : biconnected_components.cpp ;
  24 exe boost_web_graph : boost_web_graph.cpp ;
  25 exe boykov_kolmogorov-eg : boykov_kolmogorov-eg.cpp ;
  26 exe bron_kerbosch_clique_number : bron_kerbosch_clique_number.cpp ;
  27 exe bron_kerbosch_print_cliques : bron_kerbosch_print_cliques.cpp ;
  28 #exe bucket_sorter : bucket_sorter.cpp ;
  29 exe canonical_ordering : canonical_ordering.cpp ;
  30 # exe cc-internet : cc-internet.cpp ../build//boost_graph ;
  31 exe city_visitor : city_visitor.cpp ;
  32 exe closeness_centrality : closeness_centrality.cpp ;
  33 exe clustering_coefficient : clustering_coefficient.cpp ;
  34 exe components_on_edgelist : components_on_edgelist.cpp ;
  35
  36 # TODO: Duplicate?
  37 exe connected_components : connected_components.cpp ;
  38 exe connected-components : connected-components.cpp ;
  39
  40 exe container_gen : container_gen.cpp ;
  41 exe copy-example : copy-example.cpp ;
  42 # exe csr-example : csr-example.cpp ;
  43 exe cuthill_mckee_ordering : cuthill_mckee_ordering.cpp ;
  44 exe cycle_canceling_example : cycle_canceling_example.cpp ;
  45 exe cycle-file-dep2 : cycle-file-dep2.cpp ;
  46 exe cycle-file-dep : cycle-file-dep.cpp ;
  47 exe cycle_ratio_example : cycle_ratio_example.cpp ;
  48 exe dag_shortest_paths : dag_shortest_paths.cpp ;
  49 exe dave : dave.cpp ;
  50 exe default-constructor2 : default-constructor2.cpp ;
  51 exe default-constructor : default-constructor.cpp ;
  52 exe degree_centrality : degree_centrality.cpp ;
  53 exe dfs : dfs.cpp ;
  54 exe dfs-example : dfs-example.cpp ;
  55
  56 # TODO: Duplicate?
  57 exe dfs_parenthesis : dfs_parenthesis.cpp ;
  58 # exe dfs-parenthesis : dfs-parenthesis.cpp ;
  59
  60 exe dijkstra-example : dijkstra-example.cpp ;
  61 exe dijkstra-example-listS : dijkstra-example-listS.cpp ;
  62 exe dijkstra-no-color-map-example : dijkstra-no-color-map-example.cpp ;
  63 exe directed_graph : directed_graph.cpp ;
  64 exe eccentricity : eccentricity.cpp ;
  65 exe edge_basics : edge_basics.cpp ;
  66 exe edge_coloring : edge_coloring.cpp ;
  67
  68 # TODO: Duplicate?
  69 exe edge_connectivity : edge_connectivity.cpp ;
  70 # exe edge-connectivity : edge-connectivity.cpp ;
  71
  72 exe edge-function : edge-function.cpp ;
  73
  74 # TODO: Duplicate?
  75 exe edge_iterator_constructor : edge_iterator_constructor.cpp ;
  76 exe edge-iter-constructor : edge-iter-constructor.cpp ;
  77
  78 exe edge_property : edge_property.cpp ;
  79 exe edmonds-karp-eg : edmonds-karp-eg.cpp ;
  80 exe exterior_properties : exterior_properties.cpp ;
  81 exe exterior_property_map : exterior_property_map.cpp ;
  82 exe family-tree-eg : family-tree-eg.cpp ;
  83 exe fibonacci_heap : fibonacci_heap.cpp ;
  84 exe file_dependencies : file_dependencies.cpp ;
  85 exe filtered-copy-example : filtered-copy-example.cpp ;
  86 exe filtered_graph : filtered_graph.cpp ;
  87 exe filtered_graph_edge_range : filtered_graph_edge_range.cpp ;
  88 exe filtered_vec_as_graph : filtered_vec_as_graph.cpp ;
  89 exe fr_layout : fr_layout.cpp ;
  90 exe gerdemann : gerdemann.cpp ;
  91
  92 # This needs SGB headers, via BGL's stanford_graph.h:
  93 # exe girth : girth.cpp ;
  94
  95 exe graph-assoc-types : graph-assoc-types.cpp ;
  96
  97 #TODO:
  98 #exe graph_as_tree : graph_as_tree.cpp ;
  99
 100 exe graph : graph.cpp ;
 101 exe graph_property : graph_property.cpp ;
 102 exe graph-property-iter-eg : graph-property-iter-eg.cpp ;
 103 exe graph-thingie : graph-thingie.cpp /boost/graph//boost_graph ;
 104 exe graphviz : graphviz.cpp /boost/graph//boost_graph ;
 105 exe grid_graph_example : grid_graph_example.cpp ;
 106 exe grid_graph_properties : grid_graph_properties.cpp ;
 107 exe hawick_circuits : hawick_circuits.cpp ;
 108 exe implicit_graph : implicit_graph.cpp ;
 109 exe inclusive_mean_geodesic : inclusive_mean_geodesic.cpp ;
 110 exe incremental_components : incremental_components.cpp ;
 111 exe incremental-components-eg : incremental-components-eg.cpp ;
 112 exe in_edges : in_edges.cpp ;
 113 exe influence_prestige : influence_prestige.cpp ;
 114 exe interior_pmap_bundled : interior_pmap_bundled.cpp ;
 115 exe interior_property_map : interior_property_map.cpp ;
 116 exe isomorphism : isomorphism.cpp ;
 117 exe iteration_macros : iteration_macros.cpp ;
 118 exe iterator-property-map-eg : iterator-property-map-eg.cpp ;
 119 exe johnson-eg : johnson-eg.cpp ;
 120 exe kevin-bacon2 : kevin-bacon2.cpp /boost//serialization ;
 121 exe kevin-bacon : kevin-bacon.cpp ;
 122 exe king_ordering : king_ordering.cpp ;
 123 exe knights-tour : knights-tour.cpp ;
 124 exe kruskal-example : kruskal-example.cpp ;
 125 # exe kruskal-telephone : kruskal-telephone.cpp ;
 126 exe kuratowski_subgraph : kuratowski_subgraph.cpp ;
 127 # exe labeled_graph : last-mod-time.cpp ;
 128 exe last-mod-time : last-mod-time.cpp ;
 129
 130 # These need LEDA:
 131 # exe leda-concept-check : leda-concept-check.cpp ;
 132 # exe leda-graph-eg : leda-graph-eg.cpp ;
 133
 134 # exe loops_dfs : loops_dfs.cpp ;
 135 exe make_biconnected_planar : make_biconnected_planar.cpp ;
 136 exe make_maximal_planar : make_maximal_planar.cpp ;
 137 exe matching_example : matching_example.cpp ;
 138 exe max_flow : max_flow.cpp ;
 139 exe mcgregor_subgraphs_example : mcgregor_subgraphs_example.cpp ;
 140 exe mean_geodesic : mean_geodesic.cpp ;
 141
 142 # This needs SGB headers, via BGL's stanford_graph.h:
 143 # exe miles_span : miles_span.cpp ;
 144
 145 exe minimum_degree_ordering : minimum_degree_ordering.cpp iohb.c ;
 146
 147 # This has an error pragma explaining that it is incorrect.
 148 # exe min_max_paths : min_max_paths.cpp ;
 149
 150 exe modify_graph : modify_graph.cpp ;
 151 exe neighbor_bfs : neighbor_bfs.cpp ;
 152 exe ordered_out_edges : ordered_out_edges.cpp ;
 153 exe ospf-example : ospf-example.cpp ../build//boost_graph ;
 154 exe parallel-compile-time : parallel-compile-time.cpp ;
 155 exe planar_face_traversal : planar_face_traversal.cpp ;
 156 exe prim-example : prim-example.cpp ;
 157 # exe prim-telephone : prim-telephone.cpp ;
 158 exe print-adjacent-vertices : print-adjacent-vertices.cpp ;
 159 exe print-edges : print-edges.cpp ;
 160 exe print-in-edges : print-in-edges.cpp ;
 161 exe print-out-edges : print-out-edges.cpp ;
 162 exe property_iterator : property_iterator.cpp ;
 163 exe property-map-traits-eg : property-map-traits-eg.cpp ;
 164 exe push-relabel-eg : push-relabel-eg.cpp ;
 165 exe put-get-helper-eg : put-get-helper-eg.cpp ;
 166 exe quick_tour : quick_tour.cpp ;
 167 exe r_c_shortest_paths_example : r_c_shortest_paths_example.cpp ;
 168 exe read_graphviz : read_graphviz.cpp ../build//boost_graph ;
 169 exe read_write_dimacs-eg : read_write_dimacs-eg.cpp ;
 170 # exe reachable-loop-head : reachable-loop-head.cpp ;
 171 # exe reachable-loop-tail : reachable-loop-tail.cpp ;
 172 exe remove_edge_if_bidir : remove_edge_if_bidir.cpp ;
 173 exe remove_edge_if_dir : remove_edge_if_dir.cpp ;
 174 exe remove_edge_if_undir : remove_edge_if_undir.cpp ;
 175 exe reverse-graph-eg : reverse-graph-eg.cpp ;
 176
 177 # This needs SGB headers, via BGL's stanford_graph.h:
 178 # exe roget_components : roget_components.cpp ;
 179
 180 # exe quick_tour_new : quick_tour_new.cpp ;
 181 exe scaled_closeness_centrality : scaled_closeness_centrality.cpp ;
 182 # exe scc : scc.cpp ;
 183 exe simple_planarity_test : simple_planarity_test.cpp ;
 184 exe sloan_ordering : sloan_ordering.cpp ;
 185 exe stoer_wagner : stoer_wagner.cpp ;
 186 exe strong-components : strong-components.cpp ;
 187 exe strong_components : strong_components.cpp ../build//boost_graph ;
 188 exe subgraph_properties : subgraph_properties.cpp ;
 189 exe subgraph : subgraph.cpp ;
 190 exe successive_shortest_path_nonnegative_weights_example : successive_shortest_path_nonnegative_weights_example.cpp ;
 191 exe tiernan_girth_circumference : tiernan_girth_circumference.cpp ;
 192 exe tiernan_print_cycles : tiernan_print_cycles.cpp ;
 193 exe topo-sort1 : topo-sort1.cpp ;
 194 exe topo-sort2 : topo-sort2.cpp ;
 195 exe topo_sort : topo_sort.cpp ;
 196 exe topo-sort-file-dep2 : topo-sort-file-dep2.cpp ;
 197 exe topo-sort-file-dep : topo-sort-file-dep.cpp ;
 198
 199 # This needs LEDA:
 200 # exe topo-sort-with-leda : topo-sort-with-leda.cpp ;
 201
 202 # This needs SGB headers, via BGL's stanford_graph.h:
 203 # exe topo-sort-with-sgb : topo-sort-with-sgb.cpp ;
 204
 205 exe transitive_closure : transitive_closure.cpp ;
 206 exe transpose-example : transpose-example.cpp ;
 207 exe two_graphs_common_spanning_trees : two_graphs_common_spanning_trees.cpp ;
 208 exe undirected_adjacency_list : undirected_adjacency_list.cpp ;
 209 exe undirected_dfs : undirected_dfs.cpp ;
 210 exe undirected_graph : undirected_graph.cpp ;
 211 exe vector-as-graph : vector-as-graph.cpp ;
 212 exe vertex_basics : vertex_basics.cpp ;
 213 exe vertex-name-property : vertex-name-property.cpp ;
 214 exe vf2_sub_graph_iso_example : vf2_sub_graph_iso_example.cpp ;
 215 exe vf2_sub_graph_iso_multi_example : vf2_sub_graph_iso_multi_example.cpp ;
 216 exe visitor : visitor.cpp ;
 217 exe write_graphviz : write_graphviz.cpp ;
 218