boost_mirror/graph
1
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2025-05-09 23:14:00 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'develop' of https://github.com/boostorg/graph into develop

Browse Source
This commit is contained in:
jzmaddock 2019-01-26 08:38:19 +00:00
commit 36a395a14c
59 changed files with 574 additions and 348 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

388
example/Jamfile.v2
View File

@ -4,216 +4,226 @@
# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
import ../../config/checks/config : requires ;
import modules ;
import path ;
exe accum-compile-times : accum-compile-times.cpp ;
path-constant TEST_DIR : . ;
run accum-compile-times.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat $(TEST_DIR)/target-compile-costs.dat ;
exe actor_clustering : actor_clustering.cpp ;
exe adjacency_list : adjacency_list.cpp ;
exe adjacency_list_io : adjacency_list_io.cpp ;
exe adjacency_matrix : adjacency_matrix.cpp ;
exe adj_list_ra_edgelist : adj_list_ra_edgelist.cpp ;
exe astar-cities : astar-cities.cpp : [ requires unistd_h ] ;
exe astar_maze : astar_maze.cpp ;
exe bellman-example : bellman-example.cpp ;
exe bellman-ford-internet : bellman-ford-internet.cpp ;
exe bfs : bfs.cpp ;
exe bfs-example2 : bfs-example2.cpp ;
exe bfs-example : bfs-example.cpp ;
exe bfs-name-printer : bfs-name-printer.cpp ;
exe bfs_neighbor : bfs_neighbor.cpp ;
exe bipartite_example : bipartite_example.cpp ;
exe biconnected_components : biconnected_components.cpp ;
exe boost_web_graph : boost_web_graph.cpp ;
run adj_list_ra_edgelist.cpp ;
run adjacency_list.cpp ;
run adjacency_list_io.cpp ;
run adjacency_matrix.cpp ;
run astar-cities.cpp ;
run bellman-example.cpp ;
run bellman-ford-internet.cpp ;
run bfs.cpp ;
run bfs_neighbor.cpp ;
run bfs-example.cpp ;
run bfs-example2.cpp ;
run bfs-name-printer.cpp ;
run biconnected_components.cpp ;
run bipartite_example.cpp ;
run boost_web_graph.cpp : $(TEST_DIR)/boost_web.dat ;
exe boykov_kolmogorov-eg : boykov_kolmogorov-eg.cpp ;
exe bron_kerbosch_clique_number : bron_kerbosch_clique_number.cpp ;
exe bron_kerbosch_print_cliques : bron_kerbosch_print_cliques.cpp ;
#exe bucket_sorter : bucket_sorter.cpp ;
exe canonical_ordering : canonical_ordering.cpp ;
# exe cc-internet : cc-internet.cpp ../build//boost_graph ;
exe city_visitor : city_visitor.cpp ;
run canonical_ordering.cpp ;
run city_visitor.cpp ;
exe closeness_centrality : closeness_centrality.cpp ;
exe clustering_coefficient : clustering_coefficient.cpp ;
exe components_on_edgelist : components_on_edgelist.cpp ;
# TODO: Duplicate?
exe connected_components : connected_components.cpp ;
exe connected-components : connected-components.cpp ;
exe container_gen : container_gen.cpp ;
exe copy-example : copy-example.cpp ;
# exe csr-example : csr-example.cpp ;
exe cuthill_mckee_ordering : cuthill_mckee_ordering.cpp ;
exe cycle_canceling_example : cycle_canceling_example.cpp ;
exe cycle-file-dep2 : cycle-file-dep2.cpp ;
exe cycle-file-dep : cycle-file-dep.cpp ;
exe cycle_ratio_example : cycle_ratio_example.cpp ;
exe dag_shortest_paths : dag_shortest_paths.cpp ;
exe dave : dave.cpp ;
exe default-constructor2 : default-constructor2.cpp ;
exe default-constructor : default-constructor.cpp ;
run components_on_edgelist.cpp ;
run connected_components.cpp ;
run connected-components.cpp ;
run container_gen.cpp ;
run copy-example.cpp ;
run cuthill_mckee_ordering.cpp ;
run cycle_canceling_example.cpp ;
run cycle_ratio_example.cpp ;
run cycle-file-dep.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run cycle-file-dep2.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run dag_shortest_paths.cpp ;
run dave.cpp ;
run default-constructor.cpp : $(TEST_DIR)/makefile-dependencies.dat ;
run default-constructor2.cpp : $(TEST_DIR)/makefile-dependencies.dat ;
exe degree_centrality : degree_centrality.cpp ;
exe dfs : dfs.cpp ;
exe dfs-example : dfs-example.cpp ;
# TODO: Duplicate?
exe dfs_parenthesis : dfs_parenthesis.cpp ;
# exe dfs-parenthesis : dfs-parenthesis.cpp ;
exe dijkstra-example : dijkstra-example.cpp ;
exe dijkstra-example-listS : dijkstra-example-listS.cpp ;
exe dijkstra-no-color-map-example : dijkstra-no-color-map-example.cpp ;
exe directed_graph : directed_graph.cpp ;
run dfs.cpp ;
run dfs_parenthesis.cpp ;
run dfs-example.cpp ;
run dijkstra-example.cpp ;
run dijkstra-example-listS.cpp ;
run dijkstra-no-color-map-example.cpp ;
run directed_graph.cpp ;
exe eccentricity : eccentricity.cpp ;
exe edge_basics : edge_basics.cpp ;
exe edge_coloring : edge_coloring.cpp ;
# TODO: Duplicate?
exe edge_connectivity : edge_connectivity.cpp ;
# exe edge-connectivity : edge-connectivity.cpp ;
exe edge-function : edge-function.cpp ;
# TODO: Duplicate?
exe edge_iterator_constructor : edge_iterator_constructor.cpp ;
exe edge-iter-constructor : edge-iter-constructor.cpp ;
exe edge_property : edge_property.cpp ;
run edge_basics.cpp ;
run edge_coloring.cpp ;
run edge_iterator_constructor.cpp : $(TEST_DIR)/edge_iterator_constructor.dat ;
run edge_property.cpp ;
run edge-function.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run edge-iter-constructor.cpp : $(TEST_DIR)/makefile-dependencies.dat ;
exe edmonds-karp-eg : edmonds-karp-eg.cpp ;
exe exterior_properties : exterior_properties.cpp ;
exe exterior_property_map : exterior_property_map.cpp ;
exe family_tree : family_tree.cpp ;
exe fibonacci_heap : fibonacci_heap.cpp ;
exe file_dependencies : file_dependencies.cpp ;
exe filtered-copy-example : filtered-copy-example.cpp ;
exe filtered_graph : filtered_graph.cpp ;
exe filtered_graph_edge_range : filtered_graph_edge_range.cpp ;
exe filtered_vec_as_graph : filtered_vec_as_graph.cpp ;
run exterior_properties.cpp ;
run exterior_property_map.cpp ;
run family_tree.cpp ;
run fibonacci_heap.cpp ;
run file_dependencies.cpp ;
run filtered_graph.cpp ;
run filtered_graph_edge_range.cpp ;
run filtered_vec_as_graph.cpp ;
run filtered-copy-example.cpp ;
exe fr_layout : fr_layout.cpp ;
exe gerdemann : gerdemann.cpp ;
# This needs SGB headers, via BGL's stanford_graph.h:
# exe girth : girth.cpp ;
exe graph-assoc-types : graph-assoc-types.cpp ;
#TODO:
#exe graph_as_tree : graph_as_tree.cpp ;
exe graph : graph.cpp ;
exe graph_property : graph_property.cpp ;
exe graph-property-iter-eg : graph-property-iter-eg.cpp ;
exe graph-thingie : graph-thingie.cpp /boost/graph//boost_graph ;
exe graphviz : graphviz.cpp /boost/graph//boost_graph ;
exe grid_graph_example : grid_graph_example.cpp ;
exe grid_graph_properties : grid_graph_properties.cpp ;
run gerdemann.cpp ;
run graph.cpp ;
run graph_as_tree.cpp ;
run graph_property.cpp ;
run graph-assoc-types.cpp ;
run graph-property-iter-eg.cpp ;
run graph-thingie.cpp ../build//boost_graph ;
run graphviz.cpp ../build//boost_graph : $(TEST_DIR)/graphviz_example.dot ;
run grid_graph_example.cpp ;
run grid_graph_properties.cpp ;
exe hawick_circuits : hawick_circuits.cpp ;
exe implicit_graph : implicit_graph.cpp ;
run implicit_graph.cpp ;
run in_edges.cpp ;
exe inclusive_mean_geodesic : inclusive_mean_geodesic.cpp ;
exe incremental_components : incremental_components.cpp ;
exe incremental-components-eg : incremental-components-eg.cpp ;
exe in_edges : in_edges.cpp ;
run incremental_components.cpp ;
run incremental-components-eg.cpp ;
exe influence_prestige : influence_prestige.cpp ;
exe interior_pmap_bundled : interior_pmap_bundled.cpp ;
exe interior_property_map : interior_property_map.cpp ;
exe isomorphism : isomorphism.cpp ;
exe iteration_macros : iteration_macros.cpp ;
exe iterator-property-map-eg : iterator-property-map-eg.cpp ;
exe johnson-eg : johnson-eg.cpp ;
exe kevin-bacon2 : kevin-bacon2.cpp /boost//serialization ;
exe kevin-bacon : kevin-bacon.cpp ;
exe king_ordering : king_ordering.cpp ;
exe knights_tour : knights_tour.cpp ;
exe kruskal-example : kruskal-example.cpp ;
# exe kruskal-telephone : kruskal-telephone.cpp ;
exe kuratowski_subgraph : kuratowski_subgraph.cpp ;
# exe labeled_graph : last-mod-time.cpp ;
exe last-mod-time : last-mod-time.cpp : [ requires unistd_h ] ;
# These need LEDA:
# exe leda-concept-check : leda-concept-check.cpp ;
# exe leda-graph-eg : leda-graph-eg.cpp ;
# exe loops_dfs : loops_dfs.cpp ;
exe make_biconnected_planar : make_biconnected_planar.cpp ;
exe make_maximal_planar : make_maximal_planar.cpp ;
exe matching_example : matching_example.cpp ;
run interior_pmap_bundled.cpp ;
run interior_property_map.cpp ;
run isomorphism.cpp ;
run iteration_macros.cpp ;
run iterator-property-map-eg.cpp ;
run johnson-eg.cpp ;
run kevin-bacon.cpp : $(TEST_DIR)/kevin-bacon.dat ;
run king_ordering.cpp ;
run knights_tour.cpp ;
run kruskal-example.cpp ;
run kuratowski_subgraph.cpp ;
run make_biconnected_planar.cpp ;
run make_connected.cpp ;
run make_maximal_planar.cpp ;
run matching_example.cpp ;
exe max_flow : max_flow.cpp ;
exe mcgregor_subgraphs_example : mcgregor_subgraphs_example.cpp ;
run mcgregor_subgraphs_example.cpp ;
exe mean_geodesic : mean_geodesic.cpp ;
# This needs SGB headers, via BGL's stanford_graph.h:
# exe miles_span : miles_span.cpp ;
exe minimum_degree_ordering : minimum_degree_ordering.cpp iohb.c ;
# This has an error pragma explaining that it is incorrect.
# exe min_max_paths : min_max_paths.cpp ;
exe modify_graph : modify_graph.cpp ;
exe neighbor_bfs : neighbor_bfs.cpp ;
exe ordered_out_edges : ordered_out_edges.cpp ;
exe ospf-example : ospf-example.cpp ../build//boost_graph ;
exe parallel-compile-time : parallel-compile-time.cpp ;
exe planar_face_traversal : planar_face_traversal.cpp ;
exe prim-example : prim-example.cpp ;
# exe prim-telephone : prim-telephone.cpp ;
exe print-adjacent-vertices : print-adjacent-vertices.cpp ;
exe print-edges : print-edges.cpp ;
exe print-in-edges : print-in-edges.cpp ;
exe print-out-edges : print-out-edges.cpp ;
exe minimum_degree_ordering : minimum_degree_ordering.cpp ;
run modify_graph.cpp ;
run neighbor_bfs.cpp ;
run ospf-example.cpp ../build//boost_graph : $(TEST_DIR)/figs/ospf-graph.dot $(TEST_DIR)/figs/ospf-sptree.dot $(TEST_DIR)/routing-table.dat ;
run parallel-compile-time.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat $(TEST_DIR)/target-compile-costs.dat ;
run planar_face_traversal.cpp ;
run prim-example.cpp ;
run print-adjacent-vertices.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run print-edges.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run print-in-edges.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run print-out-edges.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
exe property_iterator : property_iterator.cpp ;
exe property-map-traits-eg : property-map-traits-eg.cpp ;
exe push-relabel-eg : push-relabel-eg.cpp ;
exe put-get-helper-eg : put-get-helper-eg.cpp ;
exe quick_tour : quick_tour.cpp ;
exe r_c_shortest_paths_example : r_c_shortest_paths_example.cpp ;
exe read_graphviz : read_graphviz.cpp ../build//boost_graph ;
exe read_write_dimacs-eg : read_write_dimacs-eg.cpp ;
# exe reachable-loop-head : reachable-loop-head.cpp ;
# exe reachable-loop-tail : reachable-loop-tail.cpp ;
exe remove_edge_if_bidir : remove_edge_if_bidir.cpp ;
exe remove_edge_if_dir : remove_edge_if_dir.cpp ;
exe remove_edge_if_undir : remove_edge_if_undir.cpp ;
exe reverse_graph : reverse_graph.cpp ;
# This needs SGB headers, via BGL's stanford_graph.h:
# exe roget_components : roget_components.cpp ;
# exe quick_tour_new : quick_tour_new.cpp ;
run property-map-traits-eg.cpp ;
exe push-relable : push-relabel-eg.cpp ;
run put-get-helper-eg.cpp ;
run quick_tour.cpp ;
run quick-tour.cpp ;
run r_c_shortest_paths_example.cpp ;
run read_graphviz.cpp ../build//boost_graph ;
exe read_write_dimacs : read_write_dimacs-eg.cpp ;
run remove_edge_if_bidir.cpp ;
run remove_edge_if_dir.cpp ;
run remove_edge_if_undir.cpp ;
run reverse_graph.cpp ;
exe scaled_closeness_centrality : scaled_closeness_centrality.cpp ;
# exe scc : scc.cpp ;
exe simple_planarity_test : simple_planarity_test.cpp ;
exe sloan_ordering : sloan_ordering.cpp ;
exe stoer_wagner : stoer_wagner.cpp ;
exe strong-components : strong-components.cpp ;
exe strong_components : strong_components.cpp ../build//boost_graph ;
exe subgraph_properties : subgraph_properties.cpp ;
exe subgraph : subgraph.cpp ;
exe successive_shortest_path_nonnegative_weights_example : successive_shortest_path_nonnegative_weights_example.cpp ;
run simple_planarity_test.cpp ;
run sloan_ordering.cpp ;
run stoer_wagner.cpp ;
run straight_line_drawing.cpp ;
run strong-components.cpp ;
run subgraph.cpp ;
run subgraph_properties.cpp ;
run successive_shortest_path_nonnegative_weights_example.cpp ;
exe tiernan_girth_circumference : tiernan_girth_circumference.cpp ;
exe tiernan_print_cycles : tiernan_print_cycles.cpp ;
exe topo-sort1 : topo-sort1.cpp ;
exe topo-sort2 : topo-sort2.cpp ;
exe topo_sort : topo_sort.cpp ;
exe topo-sort-file-dep2 : topo-sort-file-dep2.cpp ;
exe topo-sort-file-dep : topo-sort-file-dep.cpp ;
run topo_sort.cpp ;
run topo-sort1.cpp ;
run topo-sort2.cpp ;
run topo-sort-file-dep.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run topo-sort-file-dep2.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run transitive_closure.cpp ;
run transpose-example.cpp ;
run two_graphs_common_spanning_trees.cpp ;
run undirected_adjacency_list.cpp ;
run undirected_dfs.cpp ;
run undirected_graph.cpp ;
run vector_as_graph.cpp ;
run vertex_basics.cpp ;
run vertex-name-property.cpp : $(TEST_DIR)/makefile-dependencies.dat $(TEST_DIR)/makefile-target-names.dat ;
run vf2_sub_graph_iso_example.cpp ;
run vf2_sub_graph_iso_multi_example.cpp ;
run visitor.cpp ;
run write_graphviz.cpp ;
# This needs LEDA:
# exe topo-sort-with-leda : topo-sort-with-leda.cpp ;
#
# These require LEDA:
#
run leda-graph-eg.cpp ;
run leda-concept-check.cpp ;
run topo-sort-with-leda.cpp ;
explicit leda-graph-eg ;
explicit leda-concept-check ;
explicit topo-sort-with-leda ;
# This needs SGB headers, via BGL's stanford_graph.h:
# exe topo-sort-with-sgb : topo-sort-with-sgb.cpp ;
#
# These require standford-graph:
#
run miles_span.cpp ;
explicit miles_span ;
run roget_components.cpp ;
explicit roget_components ;
run topo-sort-with-sgb.cpp ;
explicit topo-sort-with-sgb ;
run girth.cpp ;
explicit girth ;
exe transitive_closure : transitive_closure.cpp ;
exe transpose-example : transpose-example.cpp ;
exe two_graphs_common_spanning_trees : two_graphs_common_spanning_trees.cpp ;
exe undirected_adjacency_list : undirected_adjacency_list.cpp ;
exe undirected_dfs : undirected_dfs.cpp ;
exe undirected_graph : undirected_graph.cpp ;
exe vector_as_graph : vector_as_graph.cpp ;
exe vertex_basics : vertex_basics.cpp ;
exe vertex-name-property : vertex-name-property.cpp ;
exe vf2_sub_graph_iso_example : vf2_sub_graph_iso_example.cpp ;
exe vf2_sub_graph_iso_multi_example : vf2_sub_graph_iso_multi_example.cpp ;
exe visitor : visitor.cpp ;
exe write_graphviz : write_graphviz.cpp ;
#
# This example appears incorrect:
#
#run min_max_paths.cpp ;
#
# These all use an interface that has been removed:
#
#run kruskal-telephone.cpp ;
#run loops_dfs.cpp ;
#run scc.cpp ;
#run reachable-loop-head.cpp ;
#run cc-internet.cpp ;
#run reachable-loop-tail.cpp ;
#run prim-telephone.cpp ;
#run dfs-parenthesis.cpp ;
#run edge_connectivity.cpp ;
#run edge-connectivity.cpp ;
#
# These compile, but still use the old graphviz interface and die and runtime:
# run strong_components.cpp ../build//boost_graph ;
#
# Use API that's not defined for this graph type, clear bug?
#
# run labeled_graph.cpp ;
#
# This one crashes at runtime:
#
# run astar_maze.cpp ;
# run kevin-bacon2.cpp /boost/serialization//boost_serialization : $(TEST_DIR)/kevin-bacon.dat ;
# Crashes with msvc-12.0:
# run last-mod-time.cpp : $(TEST_DIR)/makefile-dependencies.dat ;
#
# This one dereferences a null-iterator:
#
# run ordered_out_edges.cpp ;
#
# does not compile:
#
# run bucket_sorter.cpp ;
# run csr-example.cpp ;

8
example/accum-compile-times.cpp
View File

@ -48,9 +48,9 @@ typedef graph_traits<file_dep_graph2>::vertex_descriptor vertex_t;
typedef graph_traits<file_dep_graph2>::edge_descriptor edge_t;
int
main()
main(int argc, const char** argv)
{
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
typedef graph_traits<file_dep_graph2>::vertices_size_type size_type;
size_type n_vertices;
file_in >> n_vertices; // read in number of vertices
@ -76,8 +76,8 @@ main()
name_map_t name_map = get(vertex_name, g);
compile_cost_map_t compile_cost_map = get(vertex_compile_cost, g);
std::ifstream name_in("makefile-target-names.dat");
std::ifstream compile_cost_in("target-compile-costs.dat");
std::ifstream name_in(argc >= 3 ? argv[2] : "makefile-target-names.dat");
std::ifstream compile_cost_in(argc >= 4 ? argv[3] : "target-compile-costs.dat");
graph_traits < file_dep_graph2 >::vertex_iterator vi, vi_end;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) {
name_in >> name_map[*vi];

4
example/astar-cities.cpp
View File

@ -16,7 +16,7 @@
#include <boost/graph/random.hpp>
#include <boost/random.hpp>
#include <boost/graph/graphviz.hpp>
#include <sys/time.h>
#include <ctime>
#include <vector>
#include <list>
#include <iostream>
@ -170,7 +170,7 @@ int main(int argc, char **argv)
// pick random start/goal
boost::mt19937 gen(time(0));
boost::mt19937 gen(std::time(0));
vertex start = random_vertex(g, gen);
vertex goal = random_vertex(g, gen);

8
example/astar_maze.cpp
View File

@ -22,6 +22,14 @@
// The default maze size is 20x10, though different dimensions may be
// specified on the command line.
/*
IMPORTANT:
~~~~~~~~~~
This example appears to be broken and crashes at runtime, see https://github.com/boostorg/graph/issues/148
*/
#include <boost/graph/astar_search.hpp>
#include <boost/graph/filtered_graph.hpp>

4
example/boost_web_graph.cpp
View File

@ -70,11 +70,11 @@ private:
};
int
main()
main(int argc, const char** argv)
{
using namespace boost;
std::ifstream datafile("./boost_web.dat");
std::ifstream datafile(argc >= 2 ? argv[1] : "./boost_web.dat");
if (!datafile) {
std::cerr << "No ./boost_web.dat file" << std::endl;
return -1;

4
example/bron_kerbosch_clique_number.cpp
View File

@ -6,7 +6,9 @@
//[code_bron_kerbosch_clique_number
#include <iostream>
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/bron_kerbosch_all_cliques.hpp>

11
example/bucket_sorter.cpp
View File

@ -6,6 +6,17 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT:
~~~~~~~~~~
This example appears to be broken and does not compile, see https://github.com/boostorg/graph/issues/151
*/
#include <boost/config.hpp>
#include <vector>
#include <iostream>

8
example/cc-internet.cpp
View File

@ -5,6 +5,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <fstream>
#include <vector>

11
example/csr-example.cpp
View File

@ -6,6 +6,17 @@
// Authors: Douglas Gregor
// Andrew Lumsdaine
/*
IMPORTANT:
~~~~~~~~~~
This example appears to be broken and does not compile, see https://github.com/boostorg/graph/issues/150
*/
#include <boost/graph/compressed_sparse_row_graph.hpp>
#include <string>
#include <boost/graph/iteration_macros.hpp>

6
example/cycle-file-dep.cpp
View File

@ -62,9 +62,9 @@ has_cycle(const file_dep_graph & g)
int
main()
main(int argc, const char** argv)
{
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
typedef graph_traits < file_dep_graph >::vertices_size_type size_type;
size_type n_vertices;
file_in >> n_vertices; // read in number of vertices
@ -83,7 +83,7 @@ main()
#endif
std::vector < std::string > name(num_vertices(g));
std::ifstream name_in("makefile-target-names.dat");
std::ifstream name_in(argc >= 3 ? argv[2] : "makefile-target-names.dat");
graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
name_in >> name[*vi];

6
example/cycle-file-dep2.cpp
View File

@ -119,9 +119,9 @@ has_cycle(const file_dep_graph & g)
int
main()
main(int argc, const char** argv)
{
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
typedef graph_traits <file_dep_graph >::vertices_size_type size_type;
size_type n_vertices;
file_in >> n_vertices; // read in number of vertices
@ -140,7 +140,7 @@ main()
#endif
std::vector < std::string > name(num_vertices(g));
std::ifstream name_in("makefile-target-names.dat");
std::ifstream name_in(argc >= 3 ? argv[2] : "makefile-target-names.dat");
graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
name_in >> name[*vi];

4
example/default-constructor.cpp
View File

@ -29,7 +29,7 @@ read_graph_file(std::istream & in, Graph & g)
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -37,7 +37,7 @@ main()
> graph_type;
graph_type g; // use default constructor to create empty graph
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
read_graph_file(file_in, g);
assert(num_vertices(g) == 15);

4
example/default-constructor2.cpp
View File

@ -32,7 +32,7 @@ read_graph_file(std::istream & in, Graph & g)
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -40,7 +40,7 @@ main()
> graph_type;
graph_type g; // use default constructor to create empty graph
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
read_graph_file(file_in, g);
assert(num_vertices(g) == 15);

8
example/dfs-parenthesis.cpp
View File

@ -5,6 +5,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/graph/graphviz.hpp>
#include <boost/graph/depth_first_search.hpp>

8
example/edge-connectivity.cpp
View File

@ -5,6 +5,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <algorithm>
#include <utility>

6
example/edge-function.cpp
View File

@ -73,7 +73,7 @@ name_equals(const std::string & str, NameMap name)
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list<listS,// Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -82,8 +82,8 @@ main()
>graph_type;
graph_type g; // use default constructor to create empty graph
const char* dep_file_name = "makefile-dependencies.dat";
const char* target_file_name = "makefile-target-names.dat";
const char* dep_file_name = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
const char* target_file_name = argc >= 3 ? argv[2] : "makefile-target-names.dat";
std::ifstream file_in(dep_file_name), name_in(target_file_name);
if (!file_in) {

4
example/edge-iter-constructor.cpp
View File

@ -20,7 +20,7 @@ template < typename T >
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list <
listS, // Store out-edges of each vertex in a std::list
@ -28,7 +28,7 @@ main()
directedS // The graph is directed
> graph_type;
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
typedef graph_traits < graph_type >::vertices_size_type size_type;
size_type n_vertices;
file_in >> n_vertices; // read in number of vertices

7
example/edge_connectivity.cpp
View File

@ -8,6 +8,13 @@
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <set>
#include <iostream>

4
example/edge_iterator_constructor.cpp
View File

@ -91,14 +91,14 @@ bool operator!=(const edge_stream_iterator& x,
int
main()
main(int argc, const char** argv)
{
typedef boost::adjacency_list<> IteratorConstructibleGraph;
typedef boost::graph_traits<IteratorConstructibleGraph> Traits;
Traits::vertices_size_type size_V;
Traits::edges_size_type size_E;
std::ifstream f("edge_iterator_constructor.dat");
std::ifstream f(argc >= 2 ? argv[1] : "edge_iterator_constructor.dat");
f >> size_V >> size_E;
edge_stream_iterator edge_iter(f), end;

5
example/edmonds-karp-eg.cpp
View File

@ -5,6 +5,11 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <boost/config.hpp>
#include <iostream>
#include <string>

4
example/graphviz.cpp
View File

@ -71,9 +71,9 @@ void test_graph_read_write(const std::string& filename)
write_graphviz_dp(std::cout, g, dp, std::string("id"));
}
int test_main(int, char*[])
int test_main(int argc, char* argv[])
{
test_graph_read_write("graphviz_example.dot");
test_graph_read_write(argc >= 2 ? argv[1] : "graphviz_example.dot");
return 0;
}

5
example/iteration_macros.cpp
View File

@ -6,7 +6,12 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <boost/config.hpp>
#ifdef BOOST_MSVC
// Without this we get hard errors, not warnings:
#pragma warning(disable:4703)
#endif
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/iteration_macros.hpp>

4
example/kevin-bacon.cpp
View File

@ -45,9 +45,9 @@ record_bacon_number(DistanceMap d)
int
main()
main(int argc, const char** argv)
{
std::ifstream datafile("./kevin-bacon.dat");
std::ifstream datafile(argc >= 2 ? argv[1] : "./kevin-bacon.dat");
if (!datafile) {
std::cerr << "No ./kevin-bacon.dat file" << std::endl;
return EXIT_FAILURE;

14
example/kevin-bacon2.cpp
View File

@ -5,6 +5,16 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT:
~~~~~~~~~~
This example appears to be broken and crashes at runtime, see https://github.com/boostorg/graph/issues/148
*/
#include <boost/config.hpp>
#include <iostream>
#include <fstream>
@ -56,9 +66,9 @@ private:
int* d;
};
int main()
int main(int argc, const char** argv)
{
std::ifstream ifs("./kevin-bacon2.dat");
std::ifstream ifs(argc >= 2 ? argv[1] : "./kevin-bacon2.dat");
if (!ifs) {
std::cerr << "No ./kevin-bacon2.dat file" << std::endl;
return EXIT_FAILURE;

9
example/kruskal-telephone.cpp
View File

@ -5,6 +5,15 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <iostream>
#include <fstream>

8
example/labeled_graph.cpp
View File

@ -4,6 +4,14 @@
// Boost Software License, Version 1.0 (See accompanying file
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example does not compile, see https://github.com/boostorg/graph/issues/147
*/
#include <iostream>
#include <string>

22
example/last-mod-time.cpp
View File

@ -5,12 +5,28 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT:
~~~~~~~~~~
This example appears to be broken and crashes at runtime, see https://github.com/boostorg/graph/issues/148
*/
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <boost/config.hpp>
#include <iostream>
#include <fstream>
#include <string>
#include <ctime>
#ifdef BOOST_HAS_UNISTD_H
#include <unistd.h>
#endif
#include <sys/stat.h>
#include <boost/graph/adjacency_list.hpp>
@ -41,7 +57,7 @@ read_graph_file(std::istream & graph_in, std::istream & name_in,
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -50,8 +66,8 @@ main()
>graph_type;
graph_type g; // use default constructor to create empty graph
std::ifstream file_in("makefile-dependencies.dat"),
name_in("makefile-target-names.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat"),
name_in(argc >= 2 ? argv[1] : "makefile-target-names.dat");
if (!file_in) {
std::cerr << "** Error: could not open file makefile-target-names.dat"
<< std::endl;

8
example/loops_dfs.cpp
View File

@ -5,6 +5,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <boost/concept/assert.hpp>
#include <iostream>

4
example/max_flow.cpp
View File

@ -7,6 +7,10 @@
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <boost/config.hpp>
#include <iostream>
#include <string>

22
example/minimum_degree_ordering.cpp
View File

@ -30,7 +30,12 @@
#include "boost/graph/adjacency_list.hpp"
#include "boost/graph/graph_utility.hpp"
#include "boost/graph/minimum_degree_ordering.hpp"
#include "iohb.h"
void terminate(const char* msg)
{
std::cerr << msg << std::endl;
abort();
}
//copy and modify from mtl harwell boeing stream
struct harwell_boeing
@ -40,25 +45,26 @@ struct harwell_boeing
char* Type;
Type = new char[4];
isComplex = false;
readHB_info(filename, &M, &N, &nonzeros, &Type, &Nrhs);
// Never called:
//readHB_info(filename, &M, &N, &nonzeros, &Type, &Nrhs);
colptr = (int *)malloc((N+1)*sizeof(int));
if ( colptr == NULL ) IOHBTerminate("Insufficient memory for colptr.\n");
if ( colptr == NULL ) terminate("Insufficient memory for colptr.\n");
rowind = (int *)malloc(nonzeros*sizeof(int));
if ( rowind == NULL ) IOHBTerminate("Insufficient memory for rowind.\n");
if ( rowind == NULL ) terminate("Insufficient memory for rowind.\n");
if ( Type[0] == 'C' ) {
isComplex = true;
val = (double *)malloc(nonzeros*sizeof(double)*2);
if ( val == NULL ) IOHBTerminate("Insufficient memory for val.\n");
if ( val == NULL ) terminate("Insufficient memory for val.\n");
} else {
if ( Type[0] != 'P' ) {
val = (double *)malloc(nonzeros*sizeof(double));
if ( val == NULL ) IOHBTerminate("Insufficient memory for val.\n");
if ( val == NULL ) terminate("Insufficient memory for val.\n");
}
}
readHB_mat_double(filename, colptr, rowind, val);
// Never called:
//readHB_mat_double(filename, colptr, rowind, val);
cnt = 0;
col = 0;

11
example/ordered_out_edges.cpp
View File

@ -6,6 +6,17 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT:
~~~~~~~~~~
This example appears to be broken and crashes at runtime, see https://github.com/boostorg/graph/issues/149
*/
#include <boost/config.hpp>
#include <iostream>
#include <functional>

8
example/ospf-example.cpp
View File

@ -16,7 +16,7 @@ namespace boost {
}
int
main()
main(int argc, const char** argv)
{
using namespace boost;
typedef
@ -34,7 +34,7 @@ main()
dp.property("color", get(edge_color, g_dot));
dp.property("color", ref_property_map<g_dot_type*, std::string>(get_property(g_dot, graph_color)));
{
std::ifstream infile("figs/ospf-graph.dot");
std::ifstream infile(argc >= 2 ? argv[1] : "figs/ospf-graph.dot");
read_graphviz(infile, g_dot, dp);
}
@ -84,11 +84,11 @@ main()
get_property(g_dot, graph_color) = "grey";
{
std::ofstream outfile("figs/ospf-sptree.dot");
std::ofstream outfile(argc >= 3 ? argv[2] : "figs/ospf-sptree.dot");
write_graphviz_dp(outfile, g_dot, dp);
}
std::ofstream rtable("routing-table.dat");
std::ofstream rtable(argc >= 4 ? argv[3] : "routing-table.dat");
rtable << "Dest Next Hop Total Cost" << std::endl;
for (boost::tie(vi, vi_end) = vertices(g_dot); vi != vi_end; ++vi)
if (parent[*vi] != *vi) {

8
example/parallel-compile-time.cpp
View File

@ -117,9 +117,9 @@ typedef property_map < file_dep_graph2, vertex_color_t >::type color_map_t;
int
main()
main(int argc, const char** argv)
{
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
typedef graph_traits < file_dep_graph2 >::vertices_size_type size_type;
size_type n_vertices;
file_in >> n_vertices; // read in number of vertices
@ -155,8 +155,8 @@ main()
get(vertex_color, g);
{
std::ifstream name_in("makefile-target-names.dat");
std::ifstream compile_cost_in("target-compile-costs.dat");
std::ifstream name_in(argc >= 3 ? argv[2] : "makefile-target-names.dat");
std::ifstream compile_cost_in(argc >= 4 ? argv[3] : "target-compile-costs.dat");
graph_traits < file_dep_graph2 >::vertex_iterator vi, vi_end;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) {
name_in >> name_map[*vi];

8
example/prim-telephone.cpp
View File

@ -5,6 +5,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <iostream>
#include <fstream>

6
example/print-adjacent-vertices.cpp
View File

@ -73,7 +73,7 @@ name_equals(const std::string & str, NameMap name)
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -82,8 +82,8 @@ main()
>graph_type;
graph_type g; // use default constructor to create empty graph
const char* dep_file_name = "makefile-dependencies.dat";
const char* target_file_name = "makefile-target-names.dat";
const char* dep_file_name = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
const char* target_file_name = argc >= 3 ? argv[2] : "makefile-target-names.dat";
std::ifstream file_in(dep_file_name), name_in(target_file_name);
if (!file_in) {
std::cerr << "** Error: could not open file " << dep_file_name

6
example/print-edges.cpp
View File

@ -48,7 +48,7 @@ print_dependencies(std::ostream & out, const Graph & g,
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -57,8 +57,8 @@ main()
>graph_type;
graph_type g; // use default constructor to create empty graph
const char* dep_file_name = "makefile-dependencies.dat";
const char* target_file_name = "makefile-target-names.dat";
const char* dep_file_name = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
const char* target_file_name = argc >= 3 ? argv[2] : "makefile-target-names.dat";
std::ifstream file_in(dep_file_name), name_in(target_file_name);
if (!file_in) {
std::cerr << "** Error: could not open file " << dep_file_name

6
example/print-in-edges.cpp
View File

@ -72,7 +72,7 @@ name_equals(const std::string & str, NameMap name)
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -81,8 +81,8 @@ main()
>graph_type;
graph_type g; // use default constructor to create empty graph
const char* dep_file_name = "makefile-dependencies.dat";
const char* target_file_name = "makefile-target-names.dat";
const char* dep_file_name = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
const char* target_file_name = argc >= 3 ? argv[2] : "makefile-target-names.dat";
std::ifstream file_in(dep_file_name), name_in(target_file_name);
if (!file_in) {
std::cerr << "** Error: could not open file " << dep_file_name

6
example/print-out-edges.cpp
View File

@ -72,7 +72,7 @@ name_equals(const std::string & str, NameMap name)
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -81,8 +81,8 @@ main()
>graph_type;
graph_type g; // use default constructor to create empty graph
const char* dep_file_name = "makefile-dependencies.dat";
const char* target_file_name = "makefile-target-names.dat";
const char* dep_file_name = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
const char* target_file_name = argc >= 3 ? argv[2] : "makefile-target-names.dat";
std::ifstream file_in(dep_file_name), name_in(target_file_name);
if (!file_in) {
std::cerr << "** Error: could not open file " << dep_file_name

3
example/push-relabel-eg.cpp
View File

@ -5,6 +5,9 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <boost/config.hpp>
#include <iostream>
#include <string>

9
example/reachable-loop-head.cpp
View File

@ -5,6 +5,15 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <iostream>
#include <fstream>

8
example/reachable-loop-tail.cpp
View File

@ -5,6 +5,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <iostream>
#include <fstream>

3
example/read_write_dimacs-eg.cpp
View File

@ -29,6 +29,9 @@
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <boost/config.hpp>
#include <iostream>
#include <string>

8
example/scc.cpp
View File

@ -5,6 +5,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <fstream>
#include <map>

7
example/strong_components.cpp
View File

@ -7,6 +7,13 @@
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example uses interfaces that have been deprecated and removed from Boost.Grpah.
Someone needs to update it, as it does NOT compile.
*/
#include <boost/config.hpp>
#include <iostream>
#include <vector>

6
example/topo-sort-file-dep.cpp
View File

@ -57,9 +57,9 @@ topo_sort(const file_dep_graph & g, vertex_t * topo_order)
int
main()
main(int argc, const char** argv)
{
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
typedef graph_traits < file_dep_graph >::vertices_size_type size_type;
size_type n_vertices;
file_in >> n_vertices; // read in number of vertices
@ -78,7 +78,7 @@ main()
#endif
std::vector < std::string > name(num_vertices(g));
std::ifstream name_in("makefile-target-names.dat");
std::ifstream name_in(argc >= 3 ? argv[2] : "makefile-target-names.dat");
graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
name_in >> name[*vi];

6
example/topo-sort-file-dep2.cpp
View File

@ -116,9 +116,9 @@ topo_sort(const file_dep_graph & g, vertex_t * topo_order)
int
main()
main(int argc, const char** argv)
{
std::ifstream file_in("makefile-dependencies.dat");
std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
typedef graph_traits<file_dep_graph>::vertices_size_type size_type;
size_type n_vertices;
file_in >> n_vertices; // read in number of vertices
@ -138,7 +138,7 @@ main()
#endif
std::vector < std::string > name(num_vertices(g));
std::ifstream name_in("makefile-target-names.dat");
std::ifstream name_in(argc >= 2 ? argv[1] : "makefile-target-names.dat");
graph_traits < file_dep_graph >::vertex_iterator vi, vi_end;
for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi)
name_in >> name[*vi];

6
example/vertex-name-property.cpp
View File

@ -38,7 +38,7 @@ read_graph_file(std::istream & graph_in, std::istream & name_in,
int
main()
main(int argc, const char** argv)
{
typedef adjacency_list < listS, // Store out-edges of each vertex in a std::list
vecS, // Store vertex set in a std::vector
@ -47,8 +47,8 @@ main()
>graph_type;
graph_type g; // use default constructor to create empty graph
const char* dep_file_name = "makefile-dependencies.dat";
const char* target_file_name = "makefile-target-names.dat";
const char* dep_file_name = argc >= 2 ? argv[1] : "makefile-dependencies.dat";
const char* target_file_name = argc >= 3 ? argv[2] : "makefile-target-names.dat";
std::ifstream file_in(dep_file_name), name_in(target_file_name);
if (!file_in) {
std::cerr << "** Error: could not open file " << dep_file_name

3
include/boost/graph/planar_detail/boyer_myrvold_impl.hpp
View File

@ -591,7 +591,8 @@ namespace boost
first_face_itr, second_face_itr, face_end;
vertex_t first_side_vertex
= graph_traits<Graph>::null_vertex();
vertex_t second_side_vertex;
vertex_t second_side_vertex
= graph_traits<Graph>::null_vertex();
vertex_t first_tail, second_tail;
first_tail = second_tail = curr_face_handle.get_anchor();

31
test/Jamfile.v2
View File

@ -27,11 +27,10 @@ alias graph_test_regular :
[ run finish_edge_bug.cpp ]
[ run transitive_closure_test.cpp ]
[ run transitive_closure_test2.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_invalidation.cpp ]
[ run adj_list_edge_list_set.cpp ]
[ run adj_list_loops.cpp ]
[ compile adj_matrix_cc.cpp ]
@ -41,7 +40,7 @@ alias graph_test_regular :
[ run betweenness_centrality_test.cpp : 100 ]
[ run bidir_remove_edge.cpp ]
[ run bipartite_test.cpp ]
# [ run csr_graph_test.cpp : : : : : <variant>release ]
[ run csr_graph_test.cpp : : : : : <variant>release ]
[ run dag_longest_paths.cpp ]
[ run dfs.cpp ../../test/build//boost_test_exec_monitor ]
[ run undirected_dfs.cpp ../../test/build//boost_test_exec_monitor ]
@ -56,8 +55,17 @@ alias graph_test_regular :
[ compile edge_list_cc.cpp ]
[ compile filtered_graph_cc.cpp ]
[ run filter_graph_vp_test.cpp ]
[ run generator_test.cpp ]
[ run graph.cpp ]
[ run graph.cpp : : : <define>TEST=1 : graph_1 ]
[ run graph.cpp : : : <define>TEST=2 : graph_2 ]
[ run graph.cpp : : : <define>TEST=3 : graph_3 ]
[ run graph.cpp : : : <define>TEST=4 : graph_4 ]
[ run graph.cpp : : : <define>TEST=5 : graph_5 ]
[ run graph.cpp : : : <define>TEST=6 : graph_6 ]
[ run graph.cpp : : : <define>TEST=7 : graph_7 ]
[ run graph.cpp : : : <define>TEST=8 : graph_8 ]
[ run graph.cpp : : : <define>TEST=9 : graph_9 ]
[ compile graph_concepts.cpp ]
[ run graphviz_test.cpp
/boost/test//boost_test_exec_monitor/<link>static
@ -85,7 +93,15 @@ alias graph_test_regular :
[ compile vector_graph_cc.cpp ]
[ compile copy.cpp ]
[ compile swap.cpp ]
[ compile property_iter.cpp ]
[ compile property_iter.cpp : <define>TEST=1 : property_iter_1 ]
[ compile property_iter.cpp : <define>TEST=2 : property_iter_2 ]
[ compile property_iter.cpp : <define>TEST=3 : property_iter_3 ]
[ compile property_iter.cpp : <define>TEST=4 : property_iter_4 ]
[ compile property_iter.cpp : <define>TEST=5 : property_iter_5 ]
[ compile property_iter.cpp : <define>TEST=6 : property_iter_6 ]
[ compile property_iter.cpp : <define>TEST=7 : property_iter_7 ]
[ compile property_iter.cpp : <define>TEST=8 : property_iter_8 ]
[ compile property_iter.cpp : <define>TEST=9 : property_iter_9 ]
[ run bundled_properties.cpp ]
[ run floyd_warshall_test.cpp ]
[ run astar_search_test.cpp ]
@ -123,6 +139,7 @@ alias graph_test_regular :
[ run incremental_components_test.cpp ]
[ run two_graphs_common_spanning_trees_test.cpp ]
[ run random_spanning_tree_test.cpp ../build//boost_graph ]
[ run random_matching_test.cpp : 1000 1020 ]
[ run graphml_test.cpp ../build//boost_graph : : "graphml_test.xml" ]
[ run mas_test.cpp ../../test/build//boost_unit_test_framework/<link>static : $(TEST_DIR) ]
[ run stoer_wagner_test.cpp ../../test/build//boost_unit_test_framework/<link>static : $(TEST_DIR) ]
@ -136,6 +153,8 @@ alias graph_test_regular :
[ run find_flow_cost_bundled_properties_and_named_params_test.cpp ../../test/build//boost_unit_test_framework/<link>static ]
[ run max_flow_algorithms_bundled_properties_and_named_params.cpp ../../test/build//boost_unit_test_framework/<link>static ]
[ run delete_edge.cpp ]
[ run johnson-test.cpp ]
[ run lvalue_pmap.cpp ]
;
alias graph_test_with_filesystem : :

10
test/adj_list_invalidation.cpp
View File

@ -4,11 +4,19 @@
// Boost Software License, Version 1.0 (See accompanying file
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
/***********************************************************
IMPORTANT: this file should not be tested - it creates invalid graphs/sequences
which *do* crash at runtime - this seems to be the intent, but it's not
clear why or whether the file should be retained.
***********************************************************/
#include <iostream>
#include <string>
#include <boost/graph/adjacency_list.hpp>
#include "../../../../../gpld/common/typestr.hpp"
#include "typestr.hpp"
using namespace std;
using namespace boost;

77
test/adj_list_test.cpp
View File

@ -1,77 +0,0 @@
//=======================================================================
// Copyright 2002 Indiana University.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// 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)
//=======================================================================
#include <iostream>
#include <fstream>
#include <string>
#include <cstdlib>
// This is meant to be executed from the current directory
std::string container_types [] = { "vecS", "listS", "setS" };
const int N = sizeof(container_types)/sizeof(std::string);
std::string directed_types[] = { "bidirectionalS", "directedS", "undirectedS"};
const int D = sizeof(directed_types)/sizeof(std::string);
int
main()
{
int i, j, k, ret = 0, rc, t = 0;
for (i = 0; i < N; ++i)
for (j = 0; j < N; ++j)
for (k = 0; k < D; ++k, ++t) {
std::string file_name = "graph_type.hpp";
system("rm -f graph_type.hpp");
std::ofstream header(file_name.c_str());
if (!header) {
std::cerr << "could not open file " << file_name << std::endl;
return -1;
}
header << "#include <boost/graph/adjacency_list.hpp>" << std::endl
<< "typedef boost::adjacency_list<boost::" << container_types[i]
<< ", boost::" << container_types[j]
<< ", boost::" << directed_types[k]
<< ", boost::property<vertex_id_t, std::size_t>"
<< ", boost::property<edge_id_t, std::size_t> > Graph;"
<< std::endl
<< "typedef boost::property<vertex_id_t, std::size_t> VertexId;"
<< std::endl
<< "typedef boost::property<edge_id_t, std::size_t> EdgeID;"
<< std::endl;
system("rm -f graph.exe graph.o graph.obj");
// the following system call should be replaced by a
// portable "compile" command.
//const char* compile = "g++ -I.. -O2 -Wall -Wno-long-long -ftemplate-depth-30 ../libs/graph/test/graph.cpp -o graph.exe";
const char* compile = "g++ -I/u/jsiek/boost graph.cpp -o graph.exe";
std::cout << compile << std::endl;
rc = system(compile);
if (rc != 0) {
std::cerr << "compile failed for " << container_types[i] << " "
<< container_types[j] << " " << directed_types[k]
<< std::endl;
ret = -1;
} else {
rc = system("./graph.exe");
if (rc != 0) {
std::cerr << "run failed for " << container_types[i] << " "
<< container_types[j] << " " << directed_types[k]
<< std::endl;
ret = -1;
} else {
std::cout << (t+1) << " of " << (N*N*D) << " tests passed."
<< std::endl;
}
}
}
return ret;
}

1
test/csr_graph_test.cpp
View File

@ -20,7 +20,6 @@
#include <boost/graph/graph_utility.hpp>
#include <boost/random/linear_congruential.hpp>
#include <boost/concept_check.hpp> // for ignore_unused_variable_warning
#include <cassert>
#include <iostream>
#include <vector>
#include <algorithm>

7
test/dijkstra_no_color_map_compare.cpp
View File

@ -10,6 +10,12 @@
#include <iostream>
#include <map>
#include <vector>
#include <boost/config.hpp>
#ifdef BOOST_MSVC
// Without disabling this we get hard errors about initialialized pointers:
#pragma warning(disable:4703)
#endif
#include <boost/lexical_cast.hpp>
#include <boost/random.hpp>
@ -29,6 +35,7 @@
#define EDGE_NOT_RELAXED 5
#define FINISH_VERTEX 6
template <typename Graph>
void run_dijkstra_test(const Graph& graph)
{

37
test/graph_type.hpp
View File

@ -7,7 +7,42 @@
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
//
// The following test permutations are extracted from the old adj_list_test.cpp
// which generated code on the fly, but was never run as part of the regular tests.
//
#if TEST == 1
#define TEST_TYPE vecS
#define DIRECTED_TYPE bidirectionalS
#elif TEST == 2
#define TEST_TYPE vecS
#define DIRECTED_TYPE directedS
#elif TEST == 3
#define TEST_TYPE vecS
#define DIRECTED_TYPE undirectedS
#elif TEST == 4
#define TEST_TYPE listS
#define DIRECTED_TYPE bidirectionalS
#elif TEST == 5
#define TEST_TYPE listS
#define DIRECTED_TYPE directedS
#elif TEST == 6
#define TEST_TYPE listS
#define DIRECTED_TYPE undirectedS
#elif TEST == 7
#define TEST_TYPE setS
#define DIRECTED_TYPE bidirectionalS
#elif TEST == 8
#define TEST_TYPE setS
#define DIRECTED_TYPE directedS
#elif TEST == 9
#define TEST_TYPE setS
#define DIRECTED_TYPE undirectedS
#else
#error "No test combination specified - define macro TEST to the value 1 - 9."
#endif
#include <boost/graph/adjacency_list.hpp>
typedef boost::adjacency_list<boost::setS, boost::setS, boost::undirectedS, boost::property<vertex_id_t, std::size_t>, boost::property<edge_id_t, std::size_t> > Graph;
typedef boost::adjacency_list<boost::TEST_TYPE, boost::TEST_TYPE, boost::DIRECTED_TYPE, boost::property<vertex_id_t, std::size_t>, boost::property<edge_id_t, std::size_t> > Graph;
typedef boost::property<vertex_id_t, std::size_t> VertexId;
typedef boost::property<edge_id_t, std::size_t> EdgeID;

7
test/layout_test.cpp
View File

@ -6,6 +6,13 @@
// Authors: Douglas Gregor
// Andrew Lumsdaine
#include <boost/config.hpp>
#ifdef BOOST_MSVC
// Without disabling this we get hard errors about initialialized pointers:
#pragma warning(disable:4703)
#endif
#include <boost/graph/fruchterman_reingold.hpp>
#include <boost/graph/random_layout.hpp>
#include <boost/graph/kamada_kawai_spring_layout.hpp>

7
test/matching_test.cpp
View File

@ -7,6 +7,13 @@
//
//=======================================================================
#include <boost/config.hpp>
#ifdef BOOST_MSVC
// Without disabling this we get hard errors about initialialized pointers:
#pragma warning(disable:4703)
#endif
#include <boost/graph/max_cardinality_matching.hpp>
#include <iostream> // for std::cout

7
test/rcsp_custom_vertex_id.cpp
View File

@ -7,6 +7,13 @@
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <boost/config.hpp>
#ifdef BOOST_MSVC
// Without disabling this we get hard errors about initialialized pointers:
#pragma warning(disable:4703)
#endif
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/r_c_shortest_paths.hpp>

8
test/stanford_graph_cc.cpp
View File

@ -6,6 +6,14 @@
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <boost/config.hpp>
#ifdef BOOST_MSVC
// Without disabling this we get hard errors about initialialized pointers:
#pragma warning(disable:4703)
#endif
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_archetypes.hpp>
#include <boost/graph/stanford_graph.hpp>

4
test/stoer_wagner_test.cpp
View File

@ -3,6 +3,10 @@
// (See accompanying file LICENSE_1_0.txt or the copy at
// http://www.boost.org/LICENSE_1_0.txt)
#if defined(_MSC_VER) && !defined(_CRT_SECURE_NO_WARNINGS)
# define _CRT_SECURE_NO_WARNINGS
#endif
#include <fstream>
#include <iostream>
#include <map>