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
|
# Define SGB (stanford graph base top level directory) and
# LEDA (also top level directory) at the command line of jam using -s
subproject libs/graph/test ;
import testing ;
test-suite graph :
[ run transitive_closure_test.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ compile adj_list_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
# adj_list_test needs some work -JGS
# unit-test adj_list_test : adj_list_test.cpp : <sysinclude>$(BOOST_ROOT) ;
[ compile adj_matrix_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ run bfs.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ compile bfs_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ run bellman-test.cpp : <sysinclude>$(BOOST_ROOT ]
[ run betweenness_centrality_test.cpp ]
[ run dag_longest_paths.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ run dfs.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ compile dfs_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ compile dijkstra_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ run dijkstra_heap_performance.cpp : 10000 : : <sysinclude>$(BOOST_ROOT) ]
[ run relaxed_heap_test.cpp : 5000 15000 : : <sysinclude>$(BOOST_ROOT) ]
[ compile edge_list_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ compile filtered_graph_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ run graph.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ compile graph_concepts.cpp : <sysinclude>$(BOOST_ROOT) ]
[ run graphviz_test.cpp
<lib>../../test/build/boost_test_exec_monitor
<lib>../build/bgl-viz
: : : <sysinclude>$(BOOST_ROOT) ]
[ run gursoy_atun_layout_test.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ run layout_test.cpp : : : <test-info>always_show_run_output ]
[ compile reverse_graph_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ run sequential_vertex_coloring.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ run subgraph.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ run isomorphism.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ run adjacency_matrix_test.cpp : : : <sysinclude>$(BOOST_ROOT) ]
[ compile vector_graph_cc.cpp : <sysinclude>$(BOOST_ROOT) ]
[ compile copy.cpp : <sysinclude>$(BOOST_ROOT) ]
[ compile property_iter.cpp : <sysinclude>$(BOOST_ROOT) ]
[ 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 SDB tests only when -sSDB= is set.
if $(SDB) != ""
{
local SDB_DEPENDCIES =
<include>$(SGB) <library-file>$(SGB)/libgb.a ;
compile stanford_graph_cc.cpp : <sysinclude>$(BOOST_ROOT)
$(SDB_DEPENDCIES) ;
}
# Run LEDA tests only when -sLEDA= is set.
if $(LEDA) != ""
{
local LEDA_DEPENDENCIES =
<include>$(LEDA)/incl
<library-file>$(LEDA)/libG.a
;
compile leda_graph_cc.cpp : <sysinclude>$(BOOST_ROOT)
$(LEDA_DEPENDENCIES) ;
}
|
