]>
Commit | Line | Data |
---|---|---|
7c673cae FG |
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 | ||
92f5a8d4 TL |
6 | import ../../config/checks/config : requires ; |
7 | import modules ; | |
8 | import path ; | |
7c673cae | 9 | |
92f5a8d4 TL |
10 | path-constant TEST_DIR : . ; |
11 | ||
12 | run accum-compile-times.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat $(TEST_DIR)/target-compile-costs.dat ; | |
7c673cae | 13 | exe actor_clustering : actor_clustering.cpp ; |
92f5a8d4 TL |
14 | run adj_list_ra_edgelist.cpp ; |
15 | run adjacency_list.cpp ; | |
16 | run adjacency_list_io.cpp ; | |
17 | run adjacency_matrix.cpp ; | |
18 | run astar-cities.cpp ; | |
19 | run astar_maze.cpp ; | |
20 | run bellman-example.cpp ; | |
21 | run bellman-ford-internet.cpp ; | |
22 | run bfs.cpp ; | |
23 | run bfs_neighbor.cpp ; | |
24 | run bfs-example.cpp ; | |
25 | run bfs-example2.cpp ; | |
26 | run bfs-name-printer.cpp ; | |
27 | run biconnected_components.cpp ; | |
28 | run bipartite_example.cpp ; | |
29 | run boost_web_graph.cpp : $(TEST_DIR)/boost_web.dat ; | |
7c673cae FG |
30 | exe boykov_kolmogorov-eg : boykov_kolmogorov-eg.cpp ; |
31 | exe bron_kerbosch_clique_number : bron_kerbosch_clique_number.cpp ; | |
32 | exe bron_kerbosch_print_cliques : bron_kerbosch_print_cliques.cpp ; | |
92f5a8d4 TL |
33 | run bucket_sorter.cpp ; |
34 | run canonical_ordering.cpp ; | |
35 | run city_visitor.cpp ; | |
7c673cae FG |
36 | exe closeness_centrality : closeness_centrality.cpp ; |
37 | exe clustering_coefficient : clustering_coefficient.cpp ; | |
92f5a8d4 TL |
38 | run components_on_edgelist.cpp ; |
39 | run connected_components.cpp ; | |
40 | run connected-components.cpp ; | |
41 | run container_gen.cpp ; | |
42 | run copy-example.cpp ; | |
43 | run csr-example.cpp ; | |
44 | run cuthill_mckee_ordering.cpp ; | |
45 | run cycle_canceling_example.cpp ; | |
46 | run cycle_ratio_example.cpp ; | |
47 | run cycle-file-dep.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
48 | run cycle-file-dep2.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
49 | run dag_shortest_paths.cpp ; | |
50 | run dave.cpp ; | |
51 | run default-constructor.cpp : $(TEST_DIR)/makefile-dependencies.dat ; | |
52 | run default-constructor2.cpp : $(TEST_DIR)/makefile-dependencies.dat ; | |
7c673cae | 53 | exe degree_centrality : degree_centrality.cpp ; |
92f5a8d4 TL |
54 | run dfs.cpp ; |
55 | run dfs_parenthesis.cpp ; | |
56 | run dfs-example.cpp ; | |
57 | run dijkstra-example.cpp ; | |
58 | run dijkstra-example-listS.cpp ; | |
59 | run dijkstra-no-color-map-example.cpp ; | |
60 | run directed_graph.cpp ; | |
7c673cae | 61 | exe eccentricity : eccentricity.cpp ; |
92f5a8d4 TL |
62 | run edge_basics.cpp ; |
63 | run edge_coloring.cpp ; | |
64 | run edge_iterator_constructor.cpp : $(TEST_DIR)/edge_iterator_constructor.dat ; | |
65 | run edge_property.cpp ; | |
66 | run edge-function.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
67 | run edge-iter-constructor.cpp : $(TEST_DIR)/makefile-dependencies.dat ; | |
7c673cae | 68 | exe edmonds-karp-eg : edmonds-karp-eg.cpp ; |
92f5a8d4 TL |
69 | run exterior_properties.cpp ; |
70 | run exterior_property_map.cpp ; | |
71 | run family_tree.cpp ; | |
72 | run fibonacci_heap.cpp ; | |
73 | run file_dependencies.cpp ; | |
74 | run filtered_graph.cpp ; | |
75 | run filtered_graph_edge_range.cpp ; | |
76 | run filtered_vec_as_graph.cpp ; | |
77 | run filtered-copy-example.cpp ; | |
1e59de90 | 78 | exe fr_layout : fr_layout.cpp : [ requires cxx11_noexcept cxx11_rvalue_references sfinae_expr cxx11_auto_declarations cxx11_lambdas cxx11_unified_initialization_syntax cxx11_hdr_tuple cxx11_hdr_initializer_list cxx11_hdr_chrono cxx11_thread_local cxx11_constexpr cxx11_nullptr cxx11_numeric_limits cxx11_decltype cxx11_hdr_array cxx11_hdr_atomic cxx11_hdr_type_traits cxx11_allocator cxx11_explicit_conversion_operators ] ; |
92f5a8d4 TL |
79 | run gerdemann.cpp ; |
80 | run graph.cpp ; | |
81 | run graph_as_tree.cpp ; | |
82 | run graph_property.cpp ; | |
83 | run graph-assoc-types.cpp ; | |
84 | run graph-property-iter-eg.cpp ; | |
85 | run graph-thingie.cpp ../build//boost_graph ; | |
86 | run graphviz.cpp ../build//boost_graph : $(TEST_DIR)/graphviz_example.dot ; | |
87 | run grid_graph_example.cpp ; | |
88 | run grid_graph_properties.cpp ; | |
7c673cae | 89 | exe hawick_circuits : hawick_circuits.cpp ; |
92f5a8d4 TL |
90 | run implicit_graph.cpp ; |
91 | run in_edges.cpp ; | |
7c673cae | 92 | exe inclusive_mean_geodesic : inclusive_mean_geodesic.cpp ; |
92f5a8d4 TL |
93 | run incremental_components.cpp ; |
94 | run incremental-components-eg.cpp ; | |
7c673cae | 95 | exe influence_prestige : influence_prestige.cpp ; |
92f5a8d4 TL |
96 | run interior_pmap_bundled.cpp ; |
97 | run interior_property_map.cpp ; | |
98 | run isomorphism.cpp ; | |
99 | run iteration_macros.cpp ; | |
100 | run iterator-property-map-eg.cpp ; | |
101 | run johnson-eg.cpp ; | |
102 | run kevin-bacon.cpp : $(TEST_DIR)/kevin-bacon.dat ; | |
103 | run king_ordering.cpp ; | |
104 | run knights_tour.cpp ; | |
105 | run kruskal-example.cpp ; | |
106 | run kuratowski_subgraph.cpp ; | |
107 | run make_biconnected_planar.cpp ; | |
108 | run make_connected.cpp ; | |
109 | run make_maximal_planar.cpp ; | |
110 | run matching_example.cpp ; | |
7c673cae | 111 | exe max_flow : max_flow.cpp ; |
92f5a8d4 | 112 | run mcgregor_subgraphs_example.cpp ; |
7c673cae | 113 | exe mean_geodesic : mean_geodesic.cpp ; |
92f5a8d4 TL |
114 | exe minimum_degree_ordering : minimum_degree_ordering.cpp ; |
115 | run modify_graph.cpp ; | |
116 | run neighbor_bfs.cpp ; | |
117 | run ospf-example.cpp ../build//boost_graph : $(TEST_DIR)/figs/ospf-graph.dot $(TEST_DIR)/figs/ospf-sptree.dot $(TEST_DIR)/routing-table.dat ; | |
118 | run parallel-compile-time.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat $(TEST_DIR)/target-compile-costs.dat ; | |
119 | run planar_face_traversal.cpp ; | |
120 | run prim-example.cpp ; | |
121 | run print-adjacent-vertices.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
122 | run print-edges.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
123 | run print-in-edges.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
124 | run print-out-edges.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
7c673cae | 125 | exe property_iterator : property_iterator.cpp ; |
92f5a8d4 TL |
126 | run property-map-traits-eg.cpp ; |
127 | exe push-relable : push-relabel-eg.cpp ; | |
128 | run put-get-helper-eg.cpp ; | |
129 | run quick_tour.cpp ; | |
130 | run quick-tour.cpp ; | |
131 | run r_c_shortest_paths_example.cpp ; | |
132 | run read_graphviz.cpp ../build//boost_graph ; | |
133 | exe read_write_dimacs : read_write_dimacs-eg.cpp ; | |
134 | run remove_edge_if_bidir.cpp ; | |
135 | run remove_edge_if_dir.cpp ; | |
136 | run remove_edge_if_undir.cpp ; | |
137 | run reverse_graph.cpp ; | |
7c673cae | 138 | exe scaled_closeness_centrality : scaled_closeness_centrality.cpp ; |
92f5a8d4 TL |
139 | run simple_planarity_test.cpp ; |
140 | run sloan_ordering.cpp ; | |
141 | run stoer_wagner.cpp ; | |
142 | run straight_line_drawing.cpp ; | |
143 | run strong-components.cpp ; | |
144 | run subgraph.cpp ; | |
145 | run subgraph_properties.cpp ; | |
146 | run successive_shortest_path_nonnegative_weights_example.cpp ; | |
7c673cae FG |
147 | exe tiernan_girth_circumference : tiernan_girth_circumference.cpp ; |
148 | exe tiernan_print_cycles : tiernan_print_cycles.cpp ; | |
92f5a8d4 TL |
149 | run topo_sort.cpp ; |
150 | run topo-sort1.cpp ; | |
151 | run topo-sort2.cpp ; | |
152 | run topo-sort-file-dep.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
153 | run topo-sort-file-dep2.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
154 | run transitive_closure.cpp ; | |
155 | run transpose-example.cpp ; | |
156 | run two_graphs_common_spanning_trees.cpp ; | |
157 | run undirected_adjacency_list.cpp ; | |
158 | run undirected_dfs.cpp ; | |
159 | run undirected_graph.cpp ; | |
160 | run vector_as_graph.cpp ; | |
161 | run vertex_basics.cpp ; | |
162 | run vertex-name-property.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ; | |
163 | run vf2_sub_graph_iso_example.cpp ; | |
164 | run vf2_sub_graph_iso_multi_example.cpp ; | |
165 | run visitor.cpp ; | |
166 | run write_graphviz.cpp ; | |
7c673cae | 167 | |
92f5a8d4 TL |
168 | # |
169 | # These require LEDA: | |
170 | # | |
171 | run leda-graph-eg.cpp ; | |
172 | run leda-concept-check.cpp ; | |
173 | run topo-sort-with-leda.cpp ; | |
174 | explicit leda-graph-eg ; | |
175 | explicit leda-concept-check ; | |
176 | explicit topo-sort-with-leda ; | |
7c673cae | 177 | |
92f5a8d4 TL |
178 | # |
179 | # These require standford-graph: | |
180 | # | |
181 | run miles_span.cpp ; | |
182 | explicit miles_span ; | |
183 | run roget_components.cpp ; | |
184 | explicit roget_components ; | |
185 | run topo-sort-with-sgb.cpp ; | |
186 | explicit topo-sort-with-sgb ; | |
187 | run girth.cpp ; | |
188 | explicit girth ; | |
7c673cae | 189 | |
92f5a8d4 TL |
190 | # |
191 | # This example appears incorrect: | |
192 | # | |
193 | #run min_max_paths.cpp ; | |
7c673cae | 194 | |
92f5a8d4 TL |
195 | # |
196 | # These all use an interface that has been removed: | |
197 | # | |
198 | #run kruskal-telephone.cpp ; | |
199 | #run loops_dfs.cpp ; | |
200 | #run scc.cpp ; | |
201 | #run reachable-loop-head.cpp ; | |
202 | #run cc-internet.cpp ; | |
203 | #run reachable-loop-tail.cpp ; | |
204 | #run prim-telephone.cpp ; | |
205 | #run dfs-parenthesis.cpp ; | |
206 | #run edge_connectivity.cpp ; | |
207 | #run edge-connectivity.cpp ; | |
208 | # | |
209 | # These compile, but still use the old graphviz interface and die and runtime: | |
210 | # run strong_components.cpp ../build//boost_graph ; | |
211 | ||
212 | ||
213 | # | |
214 | # Use API that's not defined for this graph type, clear bug? | |
215 | # | |
216 | # run labeled_graph.cpp ; | |
217 | # | |
218 | # This one crashes at runtime: | |
219 | # | |
220 | # run kevin-bacon2.cpp /boost/serialization//boost_serialization : $(TEST_DIR)/kevin-bacon.dat ; | |
221 | # Crashes with msvc-12.0: | |
222 | # run last-mod-time.cpp : $(TEST_DIR)/makefile-dependencies.dat ; | |
223 | # | |
224 | # This one dereferences a null-iterator: | |
225 | # | |
226 | # run ordered_out_edges.cpp ; |