|
-edge_size_type
+edges_size_type
|
The unsigned integer type used for representing the number of
diff --git a/doc/gursoy_atun_layout.html b/doc/gursoy_atun_layout.html
index db61443e..8af8bbea 100644
--- a/doc/gursoy_atun_layout.html
+++ b/doc/gursoy_atun_layout.html
@@ -171,7 +171,7 @@ IN: VertexIndexMap vertex_index_map
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/hawick_circuits.html b/doc/hawick_circuits.html
index 5fabcf7c..3e6516c6 100644
--- a/doc/hawick_circuits.html
+++ b/doc/hawick_circuits.html
@@ -1,3 +1,11 @@
+
+
@@ -17,7 +25,7 @@ self-loops and redundant circuits caused by parallel edges are enumerated too.
edges are not desired.
The algorithm is described in detail in
-http://www.massey.ac.nz/~kahawick/cstn/013/cstn-013.pdf.
+http://complexity.massey.ac.nz/cstn/013/cstn-013.pdf.
Where defined
@@ -54,5 +62,5 @@ edges are not desired.
diff --git a/doc/hawick_circuits.md b/doc/hawick_circuits.md
deleted file mode 100644
index 828a71b9..00000000
--- a/doc/hawick_circuits.md
+++ /dev/null
@@ -1,53 +0,0 @@
-
-
-
-
-# `hawick_circuits`
-
- template
- void hawick_circuits(Graph const& graph, Visitor visitor, VertexIndexMap const& vim = get(vertex_index, graph));
-
- template
- void hawick_unique_circuits(Graph const& graph, Visitor visitor, VertexIndexMap const& vim = get(vertex_index, graph));
-
-Enumerate all the elementary circuits in a directed multigraph. Specifically,
-self-loops and redundant circuits caused by parallel edges are enumerated too.
-`hawick_unique_circuits` may be used if redundant circuits caused by parallel
-edges are not desired.
-
-The algorithm is described in detail in
-.
-
-
-### Where defined
-
-[`#include `](../../../boost/graph/hawick_circuits.hpp)
-
-
-### Parameters
-
-__IN:__ `Graph const& graph`
-
-> The graph on which the algorithm is to be performed. It must be a model of
-> the `VertexListGraph` and `AdjacencyGraph` concepts.
-
-__IN:__ `Visitor visitor`
-
-> The visitor that will be notified on each circuit found by the algorithm.
-> The `visitor.cycle(circuit, graph)` expression must be valid, with `circuit`
-> being a `const`-reference to a random access sequence of `vertex_descriptor`s.
->
-> For example, if a circuit `u -> v -> w -> u` exists in the graph, the
-> visitor will be called with a sequence consisting of `(u, v, w)`.
-
-__IN:__ `VertexIndexMap const& vim = get(vertex_index, graph)`
-
-> A model of the `ReadablePropertyMap` concept mapping each `vertex_descriptor`
-> to an integer in the range `[0, num_vertices(graph))`. It defaults to using
-> the vertex index map provided by the `graph`.
-
-
-------------------------------------------------------------------------------
-
diff --git a/doc/index.html b/doc/index.html
index d8f92c6d..426edef4 100644
--- a/doc/index.html
+++ b/doc/index.html
@@ -161,7 +161,7 @@ Convert Existing Graphs to the BGL). External adaptation wraps a new
interface around a data-structure without copying and without placing
the data inside adaptor objects. The BGL interface was carefully
designed to make this adaptation easy. To demonstrate this, we have
-built interfacing code for using a variety of graph dstructures (LEDA
+built interfacing code for using a variety of graph structures (LEDA
graphs, Stanford GraphBase graphs, and even Fortran-style arrays) in
BGL graph algorithms.
diff --git a/doc/isomorphism.html b/doc/isomorphism.html
index 3b86077b..7a19f3b0 100644
--- a/doc/isomorphism.html
+++ b/doc/isomorphism.html
@@ -147,7 +147,7 @@ map.
Default: get(vertex_index, g1)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
Python: Unsupported parameter.
@@ -166,7 +166,7 @@ map.
Default: get(vertex_index, g2)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
Python: Unsupported parameter.
diff --git a/doc/kamada_kawai_spring_layout.html b/doc/kamada_kawai_spring_layout.html
index 45386fc7..85ee54a2 100644
--- a/doc/kamada_kawai_spring_layout.html
+++ b/doc/kamada_kawai_spring_layout.html
@@ -246,7 +246,7 @@ As a mapping from vertices to index values between 0 and
Default:get(vertex_index,g).
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
Python: Unsupported parameter.
diff --git a/doc/kruskal_min_spanning_tree.html b/doc/kruskal_min_spanning_tree.html
index 69d2a2a9..ff65133c 100644
--- a/doc/kruskal_min_spanning_tree.html
+++ b/doc/kruskal_min_spanning_tree.html
@@ -166,7 +166,7 @@ IN: vertex_index_map(VertexIndexMap i_map)
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/metric_tsp_approx.html b/doc/metric_tsp_approx.html
index b475c9d3..fdc19d85 100644
--- a/doc/metric_tsp_approx.html
+++ b/doc/metric_tsp_approx.html
@@ -143,7 +143,7 @@ IN: VertexIndexMap indexmap
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/profile.htm b/doc/profile.htm
old mode 100755
new mode 100644
diff --git a/doc/push_relabel_max_flow.html b/doc/push_relabel_max_flow.html
index 5dff0504..d70bad3e 100644
--- a/doc/push_relabel_max_flow.html
+++ b/doc/push_relabel_max_flow.html
@@ -77,7 +77,7 @@ The time complexity is O(V3).
Where Defined
-boost/graph/preflow_push_max_flow.hpp
+boost/graph/push_relabel_max_flow.hpp
@@ -141,7 +141,7 @@ IN: vertex_index_map(VertexIndexMap index_map)
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/quick_tour.html b/doc/quick_tour.html
index 5156bb7b..7a9fd725 100644
--- a/doc/quick_tour.html
+++ b/doc/quick_tour.html
@@ -160,6 +160,8 @@ call get(vertex_index, g) returns the actual property map object.
{
// ...
+ typedef graph_traits<Graph>::vertex_descriptor Vertex;
+
// get the property map for vertex indices
typedef property_map<Graph, vertex_index_t>::type IndexMap;
IndexMap index = get(vertex_index, g);
@@ -167,8 +169,10 @@ call get(vertex_index, g) returns the actual property map object.
std::cout << "vertices(g) = ";
typedef graph_traits<Graph>::vertex_iterator vertex_iter;
std::pair<vertex_iter, vertex_iter> vp;
- for (vp = vertices(g); vp.first != vp.second; ++vp.first)
- std::cout << index[*vp.first] << " ";
+ for (vp = vertices(g); vp.first != vp.second; ++vp.first) {
+ Vertex v = *vp.first;
+ std::cout << index[v] << " ";
+ }
std::cout << std::endl;
// ...
return 0;
diff --git a/doc/r_c_shortest_paths.html b/doc/r_c_shortest_paths.html
old mode 100755
new mode 100644
diff --git a/doc/reverse_graph.html b/doc/reverse_graph.html
index bb4a10f1..761b7545 100644
--- a/doc/reverse_graph.html
+++ b/doc/reverse_graph.html
@@ -190,7 +190,7 @@ The type used for dealing with the number of vertices in the graph.
-graph_traits<reverse_graph>::edge_size_type
+graph_traits<reverse_graph>::edges_size_type
The type used for dealing with the number of edges in the graph.
diff --git a/doc/sloan_ordering.htm b/doc/sloan_ordering.htm
old mode 100755
new mode 100644
diff --git a/doc/sloan_start_end_vertices.htm b/doc/sloan_start_end_vertices.htm
old mode 100755
new mode 100644
diff --git a/doc/stanford_graph.html b/doc/stanford_graph.html
index f418deca..6940364c 100644
--- a/doc/stanford_graph.html
+++ b/doc/stanford_graph.html
@@ -124,7 +124,7 @@ headerfile <string.h> (if SYSV is #defined)
or the headerfile <strings.h> (if SYSV is not
#defined). Some compilers, like gcc/g++,
don't care much (gcc "knows" about the "string" functions without
-refering to <string.h>), but others, like MSVC on Win32, do (so
+referring to <string.h>), but others, like MSVC on Win32, do (so
all "Developer Studio Projects" in the "MSVC" subdirectory of the
SGB distribution appropriately define SYSV).
You should be careful to set (or not) SYSV according to the needs of
diff --git a/doc/strong_components.html b/doc/strong_components.html
index 64451c34..39c0cc52 100644
--- a/doc/strong_components.html
+++ b/doc/strong_components.html
@@ -84,7 +84,7 @@ records which component each vertex in the graph belongs to by
recording the component number in the component property map. The
ComponentMap type must be a model of Writable Property
-Map. The value type shouch be an integer type, preferably the same
+Map. The value type should be an integer type, preferably the same
as the vertices_size_type of the graph. The key type must be
the graph's vertex descriptor type.
@@ -162,7 +162,7 @@ IN: vertex_index_map(VertexIndexMap i_map)
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/subgraph.html b/doc/subgraph.html
index 90c6019c..4150a38d 100644
--- a/doc/subgraph.html
+++ b/doc/subgraph.html
@@ -1,17 +1,17 @@
Boost Graph Library: Subgraph
-
-
+
+
@@ -71,7 +71,7 @@ create the root graph object. Here we use adjacency_list as
the underlying graph implementation. The underlying graph type is
required to have vertex_index and edge_index
internal properties, so we add an edge index property to the adjacency
-list. We do not need to add a vertex index properety because that is
+list. We do not need to add a vertex index property because that is
built in to the adjacency_list. We will be building the graph
and subgraphs in Figure 1, so we will need a total of six vertices.
@@ -83,7 +83,7 @@ typedef subgraph< adjacency_list< vecS, vecS, directedS,
const int N = 6;
Graph G0(N);
-enum { A, B, C, D, E, F}; // for conveniently refering to vertices in G0
+enum { A, B, C, D, E, F}; // for conveniently referring to vertices in G0
Next we create two empty subgraph objects, specifying G0 as
@@ -91,8 +91,8 @@ their parent.
Graph& G1 = G0.create_subgraph(), G2 = G0.create_subgraph();
-enum { A1, B1, C2 }; // for conveniently refering to vertices in G1
-enum { A2, B2 }; // for conveniently refering to vertices in G2
+enum { A1, B1, C2 }; // for conveniently referring to vertices in G1
+enum { A2, B2 }; // for conveniently referring to vertices in G2
We can add vertices from the root graph to the subgraphs using the
@@ -187,7 +187,7 @@ the underlying Graph type.
graph_traits<subgraph>::vertex_descriptor
- The type for the vertex descriptors.
+ The type for the vertex descriptors.
(Required by Graph.)
@@ -195,7 +195,7 @@ graph_traits<subgraph>::vertex_descriptor
graph_traits<subgraph>::edge_descriptor
- The type for the edge descriptors.
+ The type for the edge descriptors.
(Required by Graph.)
@@ -203,7 +203,7 @@ graph_traits<subgraph>::edge_descriptor
graph_traits<subgraph>::vertex_iterator
- The type for the iterators returned by vertices.
+ The type for the iterators returned by vertices.
(Required by VertexListGraph.)
@@ -211,14 +211,14 @@ graph_traits<subgraph>::vertex_iterator
graph_traits<subgraph>::edge_iterator
- The type for the iterators returned by edges.
+ The type for the iterators returned by edges.
(Required by EdgeListGraph.)
graph_traits<subgraph>::out_edge_iterator
- The type for the iterators returned by out_edges.
+ The type for the iterators returned by out_edges.
(Required by IncidenceGraph.)
@@ -226,14 +226,14 @@ graph_traits<subgraph>::out_edge_iterator
graph_traits<subgraph>::in_edge_iterator
The in_edge_iterator is the
- iterator type returned by the in_edges function.
+ iterator type returned by the in_edges function.
(Required by BidirectionalGraph.)
graph_traits<subgraph>::adjacency_iterator
- The type for the iterators returned by adjacent_vertices.
+ The type for the iterators returned by adjacent_vertices.
(Required by AdjacencyGraph.)
@@ -252,7 +252,7 @@ graph_traits<subgraph>::edge_parallel_category
parallel edges (edges with the same source and target), which
depends on the underlying Graph class. The two tags are
allow_parallel_edge_tag and
- disallow_parallel_edge_tag.
+ disallow_parallel_edge_tag.
(Required by Graph.)
@@ -388,7 +388,7 @@ subgraph& parent()
std::pair<children_iterator, children_iterator> children() const
-Return an iterator pair for accessing the children subgraphs.
+Return an iterator pair for accessing the children subgraphs.
@@ -441,7 +441,7 @@ out_edges(vertex_descriptor u_local, const subgraph& g)
Returns an iterator range providing access to the out-edges of
vertex u in subgraph g. If the graph is undirected, this
iterator range provides access to all edge incident on
- vertex u.
+ vertex u.
(Required by IncidenceGraph.)
@@ -451,7 +451,7 @@ in_edges(vertex_descriptor v_local, const subgraph& g)
Returns an iterator range providing access to the in-edges of
vertex
- v in subgraph g.
+ v in subgraph g.
(Required by BidirectionalGraph.)
@@ -482,7 +482,7 @@ out_degree(vertex_descriptor u_local, const subgraph& g)
degree_size_type in_degree(vertex_descriptor u_local, const subgraph& g)
- Returns the number of edges entering vertex u in subgraph g.
+ Returns the number of edges entering vertex u in subgraph g.
(Required by BidirectionalGraph.)
@@ -543,7 +543,7 @@ void remove_edge(vertex_descriptor u_local, vertex_descriptor v_local,
subgraph& g)
Removes the edge (u,v) from the subgraph and from all of the
- ancestors of g in the subgraph tree.
+ ancestors of g in the subgraph tree.
(Required by EdgeMutableGraph.)
@@ -551,7 +551,7 @@ void remove_edge(vertex_descriptor u_local, vertex_descriptor v_local,
void remove_edge(edge_descriptor e_local, subgraph& g)
Removes the edge e from the subgraph and from all of the
- ancestors of g in the subgraph tree.
+ ancestors of g in the subgraph tree.
(Required by EdgeMutableGraph.)
@@ -591,7 +591,7 @@ get(PropertyTag, const subgraph& g)
descriptor for one subgraph will change the property for the
global vertex descriptor, and therefore for all other subgraphs.
However, the key type for a subgraph's property map is a subgraph-local
- vertex or edge descriptor.
+ vertex or edge descriptor.
(Required by PropertyGraph.)
@@ -605,7 +605,7 @@ get(PropertyTag, const subgraph& g, Key k_local)
This returns the property value for the key k_local, which
is either a local vertex or local edge descriptor. See the above
get function
- for more information about the propert maps.
+ for more information about the property maps.
(Required by PropertyGraph.)
@@ -656,11 +656,11 @@ properties into a property that contains an appropriate index. For
example:
struct my_vertex { ... };
-typedef property<vertex_index_t, std::size_t, vertex_prop> vertex_prop;
+typedef property<vertex_index_t, std::size_t, my_vertex> vertex_prop;
struct my_edge { ... };
-typedef property<edge_index_t, std::size_t, vertex_prop> edge_prop;
+typedef property<edge_index_t, std::size_t, my_edge> edge_prop;
typedef adjacency_list<vecS, listS, undirectedS, vertex_prop, edge_prop> Graph;
-typdef subgraph<Graph> Subgraph;
+typedef subgraph<Graph> Subgraph;
diff --git a/doc/successive_shortest_path_nonnegative_weights.html b/doc/successive_shortest_path_nonnegative_weights.html
index d6d53be2..434eabbb 100644
--- a/doc/successive_shortest_path_nonnegative_weights.html
+++ b/doc/successive_shortest_path_nonnegative_weights.html
@@ -214,7 +214,7 @@ IN: vertex_index_map(VertexIndexMap i_map)
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/topological_sort.html b/doc/topological_sort.html
index 0f72470f..eba74f87 100644
--- a/doc/topological_sort.html
+++ b/doc/topological_sort.html
@@ -101,7 +101,7 @@ IN: vertex_index_map(VertexIndexMap i_map)
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/transitive_closure.html b/doc/transitive_closure.html
index 58c33182..f5310b85 100644
--- a/doc/transitive_closure.html
+++ b/doc/transitive_closure.html
@@ -97,7 +97,7 @@ IN: vertex_index_map(VertexIndexMap& index_map)
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/transpose_graph.html b/doc/transpose_graph.html
index 7c7057f3..57ea481b 100644
--- a/doc/transpose_graph.html
+++ b/doc/transpose_graph.html
@@ -91,7 +91,7 @@ integers from 0 to num_vertices(G).
Default: get(vertex_index, G)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/undirected_dfs.html b/doc/undirected_dfs.html
index 78def89b..c29792d4 100644
--- a/doc/undirected_dfs.html
+++ b/doc/undirected_dfs.html
@@ -253,7 +253,7 @@ IN: vertex_index_map(VertexIndexMap i_map)
Default: get(vertex_index, g)
Note: if you use this default, make sure your graph has
an internal vertex_index property. For example,
- adjacenty_list with VertexList=listS does
+ adjacency_list with VertexList=listS does
not have an internal vertex_index property.
diff --git a/doc/users.html b/doc/users.html
index 497b1d0c..65b23306 100644
--- a/doc/users.html
+++ b/doc/users.html
@@ -33,7 +33,7 @@ or form.
BGL interface for language R.
CUJ Article about Electronic Design Automation
- A BGL-inspired Ruby Graph Library
+ A BGL-inspired Ruby Graph Library
A BGL-inspired C# Graph Library
A BGL-inspired Squeak (Smalltalk) Graph Library
BGL course at DataSim
diff --git a/doc/vf2_sub_graph_iso.html b/doc/vf2_sub_graph_iso.html
old mode 100755
new mode 100644
diff --git a/doc/wavefront.htm b/doc/wavefront.htm
old mode 100755
new mode 100644
diff --git a/doc/write-graphviz.html b/doc/write-graphviz.html
index 9af6e7b7..3899fede 100644
--- a/doc/write-graphviz.html
+++ b/doc/write-graphviz.html
@@ -70,7 +70,7 @@ write_graphviz_dp(std::ostream& out, const Graph& g,
This is to write a BGL graph object into an output stream in graphviz dot format
-so that users can make use of AT&T graphviz
+so that users can make use of graphviz
to draw a picture with nice layout.
The first version with two parameters will write the graph into a
diff --git a/example/Jamfile.v2 b/example/Jamfile.v2
index 13cdf75f..4ad34893 100644
--- a/example/Jamfile.v2
+++ b/example/Jamfile.v2
@@ -4,54 +4,215 @@
# file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
-# exe labeled_graph : labeled_graph.cpp ;
-# exe quick_tour_new : quick_tour_new.cpp ;
-exe degree_centrality : degree_centrality.cpp ;
-exe influence_prestige : influence_prestige.cpp ;
-exe closeness_centrality : closeness_centrality.cpp ;
-exe scaled_closeness_centrality : scaled_closeness_centrality.cpp ;
-exe mean_geodesic : mean_geodesic.cpp ;
-exe inclusive_mean_geodesic : inclusive_mean_geodesic.cpp ;
-exe eccentricity : eccentricity.cpp ;
-exe clustering_coefficient : clustering_coefficient.cpp ;
-exe tiernan_print_cycles : tiernan_print_cycles.cpp ;
-exe tiernan_girth_circumference : tiernan_girth_circumference.cpp ;
-exe bron_kerbosch_print_cliques : bron_kerbosch_print_cliques.cpp ;
-exe bron_kerbosch_clique_number : bron_kerbosch_clique_number.cpp ;
-exe mcgregor_subgraphs_example : mcgregor_subgraphs_example.cpp ;
-exe grid_graph_example : grid_graph_example.cpp ;
-exe grid_graph_properties : grid_graph_properties.cpp ;
-exe bipartite_example : bipartite_example.cpp ;
-exe fr_layout : fr_layout.cpp ;
-exe canonical_ordering : canonical_ordering.cpp ;
-exe components_on_edgelist : components_on_edgelist.cpp ;
-exe boykov_kolmogorov-eg : boykov_kolmogorov-eg.cpp ;
-exe ospf-example : ospf-example.cpp ../build//boost_graph ;
-# exe cc-internet : cc-internet.cpp ../build//boost_graph ;
-exe implicit_graph : implicit_graph.cpp ;
-exe astar_maze : astar_maze.cpp ;
+exe accum-compile-times : accum-compile-times.cpp ;
+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 ;
-exe stoer_wagner : stoer_wagner.cpp ;
-exe bfs-example : bfs-example.cpp ;
+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 ;
+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 ;
+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 ;
+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 adjacency_list_io : adjacency_list_io.cpp ;
-exe undirected_adjacency_list : undirected_adjacency_list.cpp ;
exe directed_graph : directed_graph.cpp ;
-exe undirected_graph : undirected_graph.cpp ;
-exe two_graphs_common_spanning_trees : two_graphs_common_spanning_trees.cpp ;
-exe strong_components : strong_components.cpp ../build//boost_graph ;
+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 ;
+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 ;
+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 ;
+exe hawick_circuits : hawick_circuits.cpp ;
+exe implicit_graph : implicit_graph.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 ;
+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 ;
+
+# 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 ;
+exe max_flow : max_flow.cpp ;
+exe mcgregor_subgraphs_example : 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 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 ;
+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 subgraph : subgraph.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 ;
+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 ;
+
+# This needs LEDA:
+# exe topo-sort-with-leda : topo-sort-with-leda.cpp ;
+
+# This needs SGB headers, via BGL's stanford_graph.h:
+# exe topo-sort-with-sgb : topo-sort-with-sgb.cpp ;
+
+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 sloan_ordering : sloan_ordering.cpp ;
-exe hawick_circuits : hawick_circuits.cpp ;
-exe edge_coloring : edge_coloring.cpp ;
-exe successive_shortest_path_nonnegative_weights_example : successive_shortest_path_nonnegative_weights_example.cpp ;
-exe cycle_canceling_example : cycle_canceling_example.cpp ;
+exe visitor : visitor.cpp ;
+exe write_graphviz : write_graphviz.cpp ;
diff --git a/example/accum-compile-times.cpp b/example/accum-compile-times.cpp
index 385d86c9..85af0482 100644
--- a/example/accum-compile-times.cpp
+++ b/example/accum-compile-times.cpp
@@ -72,15 +72,9 @@ main()
typedef property_map < file_dep_graph2, vertex_name_t >::type name_map_t;
typedef property_map < file_dep_graph2, vertex_compile_cost_t >::type
compile_cost_map_t;
- typedef property_map ::type
- distance_map_t;
- typedef property_map ::type
- color_map_t;
name_map_t name_map = get(vertex_name, g);
compile_cost_map_t compile_cost_map = get(vertex_compile_cost, g);
- distance_map_t distance_map = get(vertex_distance, g);
- color_map_t color_map = get(vertex_color, g);
std::ifstream name_in("makefile-target-names.dat");
std::ifstream compile_cost_in("target-compile-costs.dat");
diff --git a/example/adj_list_ra_edgelist.cpp b/example/adj_list_ra_edgelist.cpp
index 0c8dc032..d92ecd66 100644
--- a/example/adj_list_ra_edgelist.cpp
+++ b/example/adj_list_ra_edgelist.cpp
@@ -9,6 +9,7 @@
#include
#include
+#include
int
main()
@@ -22,8 +23,12 @@ main()
E edge_array[] = { E(0,1), E(0,2), E(0,1) };
const std::size_t m = sizeof(edge_array) / sizeof(E);
Graph g(edge_array, edge_array + m, n);
- for (std::size_t i = 0; i < m; ++i)
- std::cout << edges(g).first[i] << " ";
+
+ graph_traits::edge_iterator edge_iterator;
+ for (std::size_t i = 0; i < m; ++i) {
+ const graph_traits::edge_iterator e = edges(g).first + i;
+ std::cout << *e << " ";
+ }
std::cout << std::endl;
return 0;
diff --git a/example/connected-components.cpp b/example/connected-components.cpp
index b07f3db0..15a83ca6 100644
--- a/example/connected-components.cpp
+++ b/example/connected-components.cpp
@@ -16,7 +16,6 @@ main()
{
using namespace boost;
typedef adjacency_list < vecS, vecS, undirectedS > Graph;
- typedef graph_traits < Graph >::vertex_descriptor Vertex;
const int N = 6;
Graph G(N);
diff --git a/example/copy-example.cpp b/example/copy-example.cpp
index 41a0178a..572bb369 100644
--- a/example/copy-example.cpp
+++ b/example/copy-example.cpp
@@ -15,7 +15,6 @@ int
main()
{
using namespace boost;
- typedef int weight_t;
typedef adjacency_list < vecS, vecS, directedS,
property < vertex_name_t, char > > graph_t;
diff --git a/example/csr-example.cpp b/example/csr-example.cpp
index 6381fc54..b597193a 100644
--- a/example/csr-example.cpp
+++ b/example/csr-example.cpp
@@ -38,7 +38,7 @@ int main()
E(5, 2) };
typedef compressed_sparse_row_graph WebGraph;
- WebGraph g(&the_edges[0], &the_edges[0] + sizeof(the_edges)/sizeof(E), 6);
+ WebGraph g(boost::edges_are_sorted, &the_edges[0], &the_edges[0] + sizeof(the_edges)/sizeof(E), 6);
// Set the URLs of each vertex
int index = 0;
diff --git a/example/dfs.cpp b/example/dfs.cpp
index e68ba39a..8d68a09f 100644
--- a/example/dfs.cpp
+++ b/example/dfs.cpp
@@ -107,7 +107,6 @@ main(int , char* [])
add_edge(4, 0, G);
add_edge(4, 1, G);
- typedef graph_traits::vertex_descriptor Vertex;
typedef graph_traits::vertices_size_type size_type;
std::vector d(num_vertices(G));
diff --git a/example/dfs_parenthesis.cpp b/example/dfs_parenthesis.cpp
index 5bf04c41..6f03401e 100644
--- a/example/dfs_parenthesis.cpp
+++ b/example/dfs_parenthesis.cpp
@@ -64,9 +64,6 @@ main(int, char*[])
Graph G(edge_array, edge_array + sizeof(edge_array)/sizeof(E), 5);
#endif
- typedef boost::graph_traits::vertex_descriptor Vertex;
- typedef boost::graph_traits::vertices_size_type size_type;
-
std::cout << "DFS parenthesis:" << std::endl;
depth_first_search(G, visitor(make_dfs_visitor(std::make_pair(open_paren(),
close_paren()))));
diff --git a/example/edge_coloring.cpp b/example/edge_coloring.cpp
index 81a8a38d..1a752fd1 100644
--- a/example/edge_coloring.cpp
+++ b/example/edge_coloring.cpp
@@ -7,6 +7,7 @@
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
+#include
#include
#include
#include
@@ -56,7 +57,7 @@ int main(int, char *[])
Graph G(10);
for (size_t i = 0; i < sizeof(edges)/sizeof(edges[0]); i++)
- add_edge(edges[i].first, edges[i].second, G).first;
+ add_edge(edges[i].first, edges[i].second, G);
size_t colors = edge_coloring(G, get(edge_bundle, G));
diff --git a/example/edge_iterator_constructor.cpp b/example/edge_iterator_constructor.cpp
index 2fb6c3b3..95da715a 100644
--- a/example/edge_iterator_constructor.cpp
+++ b/example/edge_iterator_constructor.cpp
@@ -80,7 +80,7 @@ bool operator==(const edge_stream_iterator& x,
const edge_stream_iterator& y)
{
return (x.m_stream == y.m_stream && x.m_end_marker == y.m_end_marker)
- || x.m_end_marker == false && y.m_end_marker == false;
+ || (x.m_end_marker == false && y.m_end_marker == false);
}
bool operator!=(const edge_stream_iterator& x,
const edge_stream_iterator& y)
diff --git a/example/edge_property.cpp b/example/edge_property.cpp
index 3bfe575c..879e7570 100644
--- a/example/edge_property.cpp
+++ b/example/edge_property.cpp
@@ -141,8 +141,6 @@ int main(int , char* [])
add_edge(6, 8, Flow(10, Cap(8)), G);
- typedef boost::graph_traits::edge_descriptor Edge;
-
print_network(G);
property_map::type
diff --git a/example/family-tree-eg.cpp b/example/family_tree.cpp
similarity index 100%
rename from example/family-tree-eg.cpp
rename to example/family_tree.cpp
diff --git a/example/filtered-copy-example.cpp b/example/filtered-copy-example.cpp
index d16dee2d..226dfd29 100644
--- a/example/filtered-copy-example.cpp
+++ b/example/filtered-copy-example.cpp
@@ -29,7 +29,6 @@ int
main()
{
using namespace boost;
- typedef int weight_t;
typedef adjacency_list < vecS, vecS, bidirectionalS,
property < vertex_name_t, char > > graph_t;
diff --git a/example/graph-assoc-types.cpp b/example/graph-assoc-types.cpp
index 8838cffb..aedeebca 100644
--- a/example/graph-assoc-types.cpp
+++ b/example/graph-assoc-types.cpp
@@ -28,7 +28,7 @@ template < typename Graph > void
generic_bar(Graph & g)
{
// Declare some vertex and edge descriptor variables
- typename graph_traits < Graph >::vertex_descriptor u, v;
+ typename graph_traits < Graph >::vertex_descriptor u = vertex(0,g), v = vertex(1,g);
typename graph_traits < Graph >::edge_descriptor e1, e2;
// Set u and e1 to valid descriptors...
v = u; // Make v a handle to the same vertex as u.
diff --git a/example/graph-thingie.cpp b/example/graph-thingie.cpp
index 51032e1a..6b8031dd 100644
--- a/example/graph-thingie.cpp
+++ b/example/graph-thingie.cpp
@@ -89,6 +89,10 @@ const char* dot =
istringstream gvgraph(dot);
bool status = read_graphviz(gvgraph,graph,dp,"node_id");
+ if (!status) {
+ cerr << "read_graphviz() failed." << endl;
+ return -1;
+ }
cout << "graph " << get("name",dp,&graph) <<
" (" << get("identifier",dp,&graph) << ")\n\n";
diff --git a/example/graph.cpp b/example/graph.cpp
index 035b0d71..c73fba7b 100644
--- a/example/graph.cpp
+++ b/example/graph.cpp
@@ -46,7 +46,6 @@ std::size_t myrand(std::size_t N) {
template
bool check_edge(Graph& g, std::size_t a, std::size_t b) {
- typedef typename Graph::vertex_descriptor Vertex;
typename Graph::adjacency_iterator vi, viend, found;
boost::tie(vi, viend) = adjacent_vertices(vertex(a,g), g);
diff --git a/example/graph_as_tree.cpp b/example/graph_as_tree.cpp
index 4201d369..635cd179 100644
--- a/example/graph_as_tree.cpp
+++ b/example/graph_as_tree.cpp
@@ -10,6 +10,7 @@
#include
#include
#include
+#include
class tree_printer {
public:
diff --git a/example/implicit_graph.cpp b/example/implicit_graph.cpp
index 9b42e4d6..0d788735 100644
--- a/example/implicit_graph.cpp
+++ b/example/implicit_graph.cpp
@@ -381,7 +381,7 @@ edges_size_type num_edges(const ring_graph& g) {
std::pair
edge(vertex_descriptor u, vertex_descriptor v, const ring_graph& g) {
if ((u == v + 1 || v == u + 1) &&
- u >= 0 && u < num_vertices(g) && v >= 0 && v < num_vertices(g))
+ u > 0 && u < num_vertices(g) && v > 0 && v < num_vertices(g))
return std::pair(edge_descriptor(u, v), true);
else
return std::pair(edge_descriptor(), false);
diff --git a/example/incremental-components-eg.cpp b/example/incremental-components-eg.cpp
index 2ee63e4d..7faf4418 100644
--- a/example/incremental-components-eg.cpp
+++ b/example/incremental-components-eg.cpp
@@ -22,7 +22,7 @@ int main(int argc, char* argv[])
{
typedef adjacency_list Graph;
typedef graph_traits::vertex_descriptor Vertex;
- typedef graph_traits::edge_descriptor Edge;
+ //typedef graph_traits::edge_descriptor Edge;
typedef graph_traits::vertices_size_type VertexIndex;
// Create a graph
diff --git a/example/iohb.c b/example/iohb.c
index d0001621..eac5abec 100644
--- a/example/iohb.c
+++ b/example/iohb.c
@@ -227,7 +227,7 @@ Fri Aug 15 16:29:47 EDT 1997
char* substr(const char* S, const int pos, const int len);
void upcase(char* S);
-void IOHBTerminate(char* message);
+void IOHBTerminate(const char* message);
int readHB_info(const char* filename, int* M, int* N, int* nz, char** Type,
int* Nrhs)
@@ -1340,7 +1340,7 @@ int writeHB_mat_char(const char* filename, int M, int N,
int Ptrperline, Ptrwidth, Indperline, Indwidth;
int Rhsperline, Rhswidth, Rhsprec;
int Rhsflag;
- int Valperline, Valwidth, Valprec;
+ int Valperline = 1, Valwidth, Valprec;
int Valflag; /* Indicates 'E','D', or 'F' float format */
char pformat[16],iformat[16],vformat[19],rformat[19];
@@ -1602,9 +1602,9 @@ void upcase(char* S)
S[i] = toupper(S[i]);
}
-void IOHBTerminate(char* message)
+void IOHBTerminate(const char* message)
{
- fprintf(stderr,message);
+ fprintf(stderr,"%s",message);
exit(1);
}
diff --git a/example/iohb.h b/example/iohb.h
index 7c1ec21f..a986eb8b 100644
--- a/example/iohb.h
+++ b/example/iohb.h
@@ -62,7 +62,7 @@ int ParseIfmt(char* fmt, int* perline, int* width);
int ParseRfmt(char* fmt, int* perline, int* width, int* prec, int* flag);
-void IOHBTerminate(char* message);
+void IOHBTerminate(const char* message);
#ifdef __cplusplus
}
#endif
diff --git a/example/iteration_macros.cpp b/example/iteration_macros.cpp
index 49d5468c..27451f96 100644
--- a/example/iteration_macros.cpp
+++ b/example/iteration_macros.cpp
@@ -10,6 +10,7 @@
#include
#include
+#include
enum family { Jeanie, Debbie, Rick, John, Amanda, Margaret, Benjamin, N };
@@ -41,7 +42,7 @@ int main()
else
std::cout << " is the parent of ";
- BGL_FORALL_ADJACENT(i, j, g, adjacency_list<>)
+ BGL_FORALL_ADJ(i, j, g, adjacency_list<>)
std::cout << name[get(index_map, j)] << ", ";
std::cout << std::endl;
}
diff --git a/example/kevin-bacon2.cpp b/example/kevin-bacon2.cpp
index 79fb9a58..2cd17838 100644
--- a/example/kevin-bacon2.cpp
+++ b/example/kevin-bacon2.cpp
@@ -16,6 +16,7 @@
#include |