mirror of
https://github.com/boostorg/graph.git
synced 2026-01-28 07:12:14 +00:00
136 lines
11 KiB
Plaintext
136 lines
11 KiB
Plaintext
subproject libs/graph/example ;
|
|
|
|
# Define SGB (stanford graph base top level directory) and
|
|
# LEDA (also top level directory) at the command line of jam using -s
|
|
|
|
|
|
DEPENDS all : accum-compile-times adjacency_list adjacency_list_io adjacency_matrix bellman-example bellman-ford-internet bfs bfs-example bfs-name-printer bfs_neighbor biconnected_components boost_web_graph bucket_sorter cc-internet city_visitor components_on_edgelist connected_components connected-components container_gen copy-example cuthill_mckee_ordering cycle-file-dep2 cycle-file-dep dag_shortest_paths dave default-constructor2 default-constructor dfs dfs-example dfs_parenthesis dfs-parenthesis dijkstra-example edge_basics edge_connectivity edge-connectivity edge-function edge_iterator_constructor edge-iter-constructor edge_property edmunds-karp-eg edmunds_karp_max_flow exterior_properties exterior_property_map family-tree-eg fibonacci_heap file_dependencies filtered_graph gerdemann graph-assoc-types graph graph-property-iter-eg graphviz incremental_components incremental-components-eg in_edges interior_property_map isomorphism iterator-property-map-eg johnson johnson-eg kevin-bacon knights-tour koenig-lookup kruskal-example kruskal-telephone last-mod-time loops_dfs max_flow minimum_degree_ordering min_max_paths modify_graph neighbor_bfs ordered_out_edges ospf-example parallel-compile-time prim-example prim-telephone print-adjacent-vertices print-edges print-in-edges print-out-edges property_iterator property-map-traits-eg push-relabel-eg put-get-helper-eg quick_tour quick-tour reachable-loop-head reachable-loop-tail remove_edge_if_bidir remove_edge_if_dir remove_edge_if_undir reverse_graph reverse-graph-eg scc strong_components strong-components subgraph topo-sort1 topo-sort2 topo_sort topo-sort-file-dep2 topo-sort-file-dep transitive_closure transpose-example undirected vector-as-graph vertex_basics vertex-name-property visitor ;
|
|
|
|
DEPENDS sgb_examples : topo-sort-with-sgb girth miles_span roget_components ;
|
|
DEPENDS leda_examples : leda-concept-check leda-graph-eg topo-sort-with-leda ;
|
|
|
|
exe accum-compile-times : accum-compile-times.cpp : <include>$(BOOST_ROOT) ;
|
|
exe adjacency_list : adjacency_list.cpp : <include>$(BOOST_ROOT) ;
|
|
exe adjacency_list_io : adjacency_list_io.cpp : <include>$(BOOST_ROOT) ;
|
|
exe adjacency_matrix : adjacency_matrix.cpp : <include>$(BOOST_ROOT) ;
|
|
exe bellman-example : bellman-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe bellman-ford-internet : bellman-ford-internet.cpp : <include>$(BOOST_ROOT) ;
|
|
exe bfs : bfs.cpp : <include>$(BOOST_ROOT) ;
|
|
exe bfs-example : bfs-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe bfs-name-printer : bfs-name-printer.cpp : <include>$(BOOST_ROOT) ;
|
|
exe bfs_neighbor : bfs_neighbor.cpp : <include>$(BOOST_ROOT) ;
|
|
exe biconnected_components : biconnected_components.cpp : <include>$(BOOST_ROOT) ;
|
|
exe boost_web_graph : boost_web_graph.cpp : <include>$(BOOST_ROOT) ;
|
|
exe bucket_sorter : bucket_sorter.cpp : <include>$(BOOST_ROOT) ;
|
|
exe cc-internet : cc-internet.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe city_visitor : city_visitor.cpp : <include>$(BOOST_ROOT) ;
|
|
exe components_on_edgelist : components_on_edgelist.cpp : <include>$(BOOST_ROOT) ;
|
|
exe connected_components : connected_components.cpp : <include>$(BOOST_ROOT) ;
|
|
exe connected-components : connected-components.cpp : <include>$(BOOST_ROOT) ;
|
|
exe container_gen : container_gen.cpp : <include>$(BOOST_ROOT) ;
|
|
exe copy-example : copy-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe cuthill_mckee_ordering : cuthill_mckee_ordering.cpp : <include>$(BOOST_ROOT) ;
|
|
exe cycle-file-dep2 : cycle-file-dep2.cpp : <include>$(BOOST_ROOT) ;
|
|
exe cycle-file-dep : cycle-file-dep.cpp : <include>$(BOOST_ROOT) ;
|
|
exe dag_shortest_paths : dag_shortest_paths.cpp : <include>$(BOOST_ROOT) ;
|
|
exe dave : dave.cpp : <include>$(BOOST_ROOT) ;
|
|
exe default-constructor2 : default-constructor2.cpp : <include>$(BOOST_ROOT) ;
|
|
exe default-constructor : default-constructor.cpp : <include>$(BOOST_ROOT) ;
|
|
exe dfs : dfs.cpp : <include>$(BOOST_ROOT) ;
|
|
exe dfs-example : dfs-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe dfs-parenthesis : dfs-parenthesis.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe dijkstra-example : dijkstra-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edge_basics : edge_basics.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edge_connectivity : edge_connectivity.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edge-connectivity : edge-connectivity.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe edge-function : edge-function.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edge_iterator_constructor : edge_iterator_constructor.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edge-iter-constructor : edge-iter-constructor.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edge_property : edge_property.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edmunds-karp-eg : edmunds-karp-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe edmunds_karp_max_flow : edmunds_karp_max_flow.cpp : <include>$(BOOST_ROOT) ;
|
|
exe exterior_properties : exterior_properties.cpp : <include>$(BOOST_ROOT) ;
|
|
exe exterior_property_map : exterior_property_map.cpp : <include>$(BOOST_ROOT) ;
|
|
exe family-tree-eg : family-tree-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe fibonacci_heap : fibonacci_heap.cpp : <include>$(BOOST_ROOT) ;
|
|
exe file_dependencies : file_dependencies.cpp : <include>$(BOOST_ROOT) ;
|
|
exe filtered_graph : filtered_graph.cpp : <include>$(BOOST_ROOT) ;
|
|
exe gerdemann : gerdemann.cpp : <include>$(BOOST_ROOT) ;
|
|
exe girth : girth.cpp : <include>$(BOOST_ROOT) <include>$(SGB)
|
|
<library-file>$(SGB)/libgb.a ;
|
|
exe graph-assoc-types : graph-assoc-types.cpp : <include>$(BOOST_ROOT) ;
|
|
exe graph : graph.cpp : <include>$(BOOST_ROOT) ;
|
|
exe graph-property-iter-eg : graph-property-iter-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe graphviz : graphviz.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe incremental_components : incremental_components.cpp : <include>$(BOOST_ROOT) ;
|
|
exe incremental-components-eg : incremental-components-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe in_edges : in_edges.cpp : <include>$(BOOST_ROOT) ;
|
|
exe interior_property_map : interior_property_map.cpp : <include>$(BOOST_ROOT) ;
|
|
exe isomorphism : isomorphism.cpp : <include>$(BOOST_ROOT) ;
|
|
exe iterator-property-map-eg : iterator-property-map-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe johnson-eg : johnson-eg.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe kevin-bacon : kevin-bacon.cpp : <include>$(BOOST_ROOT) ;
|
|
exe knights-tour : knights-tour.cpp : <include>$(BOOST_ROOT) ;
|
|
exe koenig-lookup : koenig-lookup.cpp : <include>$(BOOST_ROOT) ;
|
|
exe kruskal-example : kruskal-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe kruskal-telephone : kruskal-telephone.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe last-mod-time : last-mod-time.cpp : <include>$(BOOST_ROOT) ;
|
|
exe leda-concept-check : leda-concept-check.cpp : <include>$(BOOST_ROOT)
|
|
<include>$(LEDA)/incl <library-file>$(LEDA)/libG.a <library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a ;
|
|
exe leda-graph-eg : leda-graph-eg.cpp : <include>$(BOOST_ROOT)
|
|
<include>$(LEDA)/incl <library-file>$(LEDA)/libG.a
|
|
<library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a ;
|
|
exe loops_dfs : loops_dfs.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe max_flow : max_flow.cpp : <include>$(BOOST_ROOT) ;
|
|
exe miles_span : miles_span.cpp : <include>$(BOOST_ROOT) <include>$(SGB)
|
|
<library-file>$(SGB)/libgb.a ;
|
|
exe minimum_degree_ordering : minimum_degree_ordering.cpp iohb.c : <include>$(BOOST_ROOT) ;
|
|
exe min_max_paths : min_max_paths.cpp : <include>$(BOOST_ROOT) ;
|
|
exe modify_graph : modify_graph.cpp : <include>$(BOOST_ROOT) ;
|
|
exe neighbor_bfs : neighbor_bfs.cpp : <include>$(BOOST_ROOT) ;
|
|
exe ordered_out_edges : ordered_out_edges.cpp : <include>$(BOOST_ROOT) ;
|
|
exe ospf-example : ospf-example.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe parallel-compile-time : parallel-compile-time.cpp : <include>$(BOOST_ROOT) ;
|
|
exe prim-example : prim-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe prim-telephone : prim-telephone.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe print-adjacent-vertices : print-adjacent-vertices.cpp : <include>$(BOOST_ROOT) ;
|
|
exe print-edges : print-edges.cpp : <include>$(BOOST_ROOT) ;
|
|
exe print-in-edges : print-in-edges.cpp : <include>$(BOOST_ROOT) ;
|
|
exe print-out-edges : print-out-edges.cpp : <include>$(BOOST_ROOT) ;
|
|
exe property_iterator : property_iterator.cpp : <include>$(BOOST_ROOT) ;
|
|
exe property-map-traits-eg : property-map-traits-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe push-relabel-eg : push-relabel-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe put-get-helper-eg : put-get-helper-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe quick_tour : quick_tour.cpp : <include>$(BOOST_ROOT) ;
|
|
exe quick-tour : quick-tour.cpp : <include>$(BOOST_ROOT) ;
|
|
exe reachable-loop-head : reachable-loop-head.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe reachable-loop-tail : reachable-loop-tail.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe remove_edge_if_bidir : remove_edge_if_bidir.cpp : <include>$(BOOST_ROOT) ;
|
|
exe remove_edge_if_dir : remove_edge_if_dir.cpp : <include>$(BOOST_ROOT) ;
|
|
exe remove_edge_if_undir : remove_edge_if_undir.cpp : <include>$(BOOST_ROOT) ;
|
|
exe reverse_graph : reverse_graph.cpp : <include>$(BOOST_ROOT) ;
|
|
exe reverse-graph-eg : reverse-graph-eg.cpp : <include>$(BOOST_ROOT) ;
|
|
exe roget_components : roget_components.cpp : <include>$(BOOST_ROOT)
|
|
<include>$(SGB) <library-file>$(SGB)/libgb.a ;
|
|
exe scc : scc.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe strong_components : strong_components.cpp <lib>../build/libbgl-viz : <include>$(BOOST_ROOT) ;
|
|
exe strong-components : strong-components.cpp : <include>$(BOOST_ROOT) ;
|
|
exe subgraph : subgraph.cpp : <include>$(BOOST_ROOT) ;
|
|
exe topo-sort1 : topo-sort1.cpp : <include>$(BOOST_ROOT) ;
|
|
exe topo-sort2 : topo-sort2.cpp : <include>$(BOOST_ROOT) ;
|
|
exe topo_sort : topo_sort.cpp : <include>$(BOOST_ROOT) ;
|
|
exe topo-sort-file-dep2 : topo-sort-file-dep2.cpp : <include>$(BOOST_ROOT) ;
|
|
exe topo-sort-file-dep : topo-sort-file-dep.cpp : <include>$(BOOST_ROOT) ;
|
|
exe topo-sort-with-leda : topo-sort-with-leda.cpp : <include>$(BOOST_ROOT)
|
|
<include>$(LEDA)/incl <library-file>$(LEDA)/libG.a
|
|
<library-file>$(LEDA)/libL.a <library-file>$(LEDA)/libP.a ;
|
|
exe topo-sort-with-sgb : topo-sort-with-sgb.cpp : <include>$(BOOST_ROOT)
|
|
<include>$(SGB) <library-file>$(SGB)/libgb.a ;
|
|
exe transitive_closure : transitive_closure.cpp : <include>$(BOOST_ROOT) ;
|
|
exe transpose-example : transpose-example.cpp : <include>$(BOOST_ROOT) ;
|
|
exe undirected : undirected.cpp : <include>$(BOOST_ROOT) ;
|
|
exe vector-as-graph : vector-as-graph.cpp : <include>$(BOOST_ROOT) ;
|
|
exe vertex_basics : vertex_basics.cpp : <include>$(BOOST_ROOT) ;
|
|
exe vertex-name-property : vertex-name-property.cpp : <include>$(BOOST_ROOT) ;
|
|
exe visitor : visitor.cpp : <include>$(BOOST_ROOT) ;
|