# 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 : : : $(BOOST_ROOT) ] [ compile adj_list_cc.cpp : $(BOOST_ROOT) ] # adj_list_test needs some work -JGS # unit-test adj_list_test : adj_list_test.cpp : $(BOOST_ROOT) ; [ compile adj_matrix_cc.cpp : $(BOOST_ROOT) ] [ run bfs.cpp ../../test/build/boost_test_exec_monitor : : : $(BOOST_ROOT) ] [ compile bfs_cc.cpp : $(BOOST_ROOT) ] [ run betweenness_centrality_test.cpp ] [ run dfs.cpp ../../test/build/boost_test_exec_monitor : : : $(BOOST_ROOT) ] [ compile dfs_cc.cpp : $(BOOST_ROOT) ] [ compile dijkstra_cc.cpp : $(BOOST_ROOT) ] [ compile edge_list_cc.cpp : $(BOOST_ROOT) ] [ compile filtered_graph_cc.cpp : $(BOOST_ROOT) ] [ run graph.cpp : : : $(BOOST_ROOT) ] [ compile graph_concepts.cpp : $(BOOST_ROOT) ] [ run layout_test.cpp : : : always_show_run_output ] [ compile reverse_graph_cc.cpp : $(BOOST_ROOT) ] [ run subgraph.cpp ../../test/build/boost_test_exec_monitor : : : $(BOOST_ROOT) ] [ run isomorphism.cpp ../../test/build/boost_test_exec_monitor : : : $(BOOST_ROOT) ] [ run adjacency_matrix_test.cpp : : : $(BOOST_ROOT) ] [ compile vector_graph_cc.cpp : $(BOOST_ROOT) ] [ compile copy.cpp : $(BOOST_ROOT) ] [ compile property_iter.cpp : $(BOOST_ROOT) ] [ run bundled_properties.cpp ] ; # Run SDB tests only when -sSDB= is set. if $(SDB) != "" { local SDB_DEPENDCIES = $(SGB) $(SGB)/libgb.a ; compile stanford_graph_cc.cpp : $(BOOST_ROOT) $(SDB_DEPENDCIES) ; } # Run LEDA tests only when -sLEDA= is set. if $(LEDA) != "" { local LEDA_DEPENDENCIES = $(LEDA)/incl $(LEDA)/libG.a ; compile leda_graph_cc.cpp : $(BOOST_ROOT) $(LEDA_DEPENDENCIES) ; }