1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
# Copyright (c) 2002 Trustees of Indiana University
#
# Distributed under the Boost Software License, Version 1.0.
# (See accompanying file LICENSE_1_0.txt or copy at
# http://www.boost.org/LICENSE_1_0.txt)
# Define SGB (stanford graph base top level directory) and
# LEDA (also top level directory) at the command line of jam using -s
import modules ;
test-suite graph_test :
[ run transitive_closure_test.cpp ]
[ compile adj_list_cc.cpp ]
# adj_list_test needs some work -JGS
# unit-test adj_list_test : adj_list_test.cpp ;
[ run adj_list_edge_list_set.cpp ]
[ compile adj_matrix_cc.cpp ]
[ run bfs.cpp ../../test/build//boost_test_exec_monitor ]
[ compile bfs_cc.cpp ]
[ run bellman-test.cpp ]
[ run betweenness_centrality_test.cpp ]
[ run bidir_remove_edge.cpp ]
[ run csr_graph_test.cpp : : : : : <variant>release ]
[ run dag_longest_paths.cpp ]
[ run dfs.cpp ../../test/build//boost_test_exec_monitor ]
[ compile dfs_cc.cpp ]
[ compile dijkstra_cc.cpp ]
[ run dijkstra_heap_performance.cpp : 10000 ]
[ run dominator_tree_test.cpp ]
[ run relaxed_heap_test.cpp : 5000 15000 ]
[ compile edge_list_cc.cpp ]
[ compile filtered_graph_cc.cpp ]
[ run graph.cpp ]
[ compile graph_concepts.cpp ]
[ run graphviz_test.cpp
/boost/test//boost_test_exec_monitor/<link>static
../build//boost_graph ]
[ run gursoy_atun_layout_test.cpp ]
[ run layout_test.cpp : : : <test-info>always_show_run_output <toolset>intel:<debug-symbols>off ]
[ run serialize.cpp
../../serialization/build//boost_serialization
: : : ]
[ compile reverse_graph_cc.cpp ]
[ run sequential_vertex_coloring.cpp ]
[ run subgraph.cpp ../../test/build//boost_test_exec_monitor ]
[ run isomorphism.cpp ../../test/build//boost_test_exec_monitor ]
[ run adjacency_matrix_test.cpp ]
[ compile vector_graph_cc.cpp ]
[ compile copy.cpp ]
[ compile property_iter.cpp ]
[ run bundled_properties.cpp ]
[ run floyd_warshall_test.cpp ]
[ run astar_search_test.cpp ]
[ run biconnected_components_test.cpp ]
[ run cuthill_mckee_ordering.cpp ]
[ run king_ordering.cpp ]
[ run matching_test.cpp ]
;
# Run SDB tests only when -sSDB= is set.
if [ modules.peek : SDB ] != ""
{
local SDB_DEPENDCIES =
<include>$(SGB) <library-file>$(SGB)/libgb.a ;
compile stanford_graph_cc.cpp
$(SDB_DEPENDCIES) ;
}
# Run LEDA tests only when -sLEDA= is set.
if [ modules.peek : LEDA ] != ""
{
local LEDA_DEPENDENCIES =
<include>$(LEDA)/incl
<library-file>$(LEDA)/libG.a
;
compile leda_graph_cc.cpp
$(LEDA_DEPENDENCIES) ;
}
|
