DegreeMap degree_map (IN)
@@ -184,15 +184,15 @@ For version 1:
For version 4:
- Graph& g (IN)
- An undirected graph. The graph's type must be a model of IncidenceGraph.
- OutputIterator permutation (OUT)
- The new vertex ordering. The vertices are written to the output iterator in
- their new order.
+ The new vertex ordering. The vertices are written to the output iterator in
+ their new order.
- ColorMap color_map (WORK)
- Used internally to keep track of the progress of the algorithm (to avoid visiting
- the same vertex twice).
+ Used internally to keep track of the progress of the algorithm (to avoid visiting
+ the same vertex twice).
- PriorityMap priority_map (IN)
Used internally to store the priority for renumbering of each vertex.
- DegreeMap degree_map (IN)
@@ -200,25 +200,25 @@ For version 1:
Example
-See example/sloan_ordering.cpp.
+See example/sloan_ordering.cpp.
See Also
-sloan_start_end_vertices,
- bandwidth, profile, wavefront
+
sloan_start_end_vertices,
+ bandwidth, profile, wavefront
and degree_property_map in boost/graph/properties.hpp.
-[1] S. W. Sloan, An algorithm for profile and wavefront reduction of sparse
+
[1] S. W. Sloan, An algorithm for profile and wavefront reduction of sparse
matrices, Int. j. numer. methods eng., 23, 239 - 251 (1986)
-[2] S. W. Sloan, A fortran program for profile and wavefront reduction,
+
[2] S. W. Sloan, A fortran program for profile and wavefront reduction,
Int. j. numer. methods eng., 28, 2651 - 2679 (1989)
diff --git a/doc/sloan_start_end_vertices.htm b/doc/sloan_start_end_vertices.htm
index 1f5ea48f..6561d5cc 100644
--- a/doc/sloan_start_end_vertices.htm
+++ b/doc/sloan_start_end_vertices.htm
@@ -9,9 +9,9 @@
-- http://www.boost.org/LICENSE_1_0.txt)
-->
-![C++ Boost]()
+![C++ Boost]()
sloan_start_end_vertices
@@ -34,53 +34,53 @@ src="../../../boost.png" width=277>
typename graph_traits<Graph>::vertex_descriptor
sloan_start_end_vertices(Graph& G,
typename graph_traits<Graph>::vertex_descriptor &s,
- ColorMap color,
+ ColorMap color,
DegreeMap degree )
-
The goal of the sloan_start_end_vertices algorithm[1, 2] is to find good start-
- and end-vertices for the profile and wavefront reduction algorithm sloan_ordering.
- The algorithm is similar to pseudo_peripheral_pair and also based on breadth_first_search.
- With this breadth_first_search function a so-called rooted level structure (RLS)
- is formed, where the vertices with the same distance to the starting vertex
- are grouped together. The maximum number of vertices in one group is called
- the width of the RLS. Sloan_start_end_vertices tries to find a pseudoperipheral
+
The goal of the sloan_start_end_vertices algorithm[1, 2] is to find good start-
+ and end-vertices for the profile and wavefront reduction algorithm sloan_ordering.
+ The algorithm is similar to pseudo_peripheral_pair and also based on breadth_first_search.
+ With this breadth_first_search function a so-called rooted level structure (RLS)
+ is formed, where the vertices with the same distance to the starting vertex
+ are grouped together. The maximum number of vertices in one group is called
+ the width of the RLS. Sloan_start_end_vertices tries to find a pseudoperipheral
pair with a minimum RLS-width.
Parameters
-For version 1:
+For version 1:
- Graph& g (IN)
- An undirected graph. The graph's type must be a model of IncidenceGraph.
+ An undirected graph. The graph's type must be a model of IncidenceGraph.
- vertex_descriptor s (IN)
- The starting vertex.
+ The starting vertex.
- ColorMap color_map (WORK)
- Used internally to keep track of the progress of the algorithm (to avoid visiting
- the same vertex twice).
+ Used internally to keep track of the progress of the algorithm (to avoid visiting
+ the same vertex twice).
- DegreeMap degree_map (IN)
This must map vertices to their degree.
Example
-See example/sloan_ordering.cpp.
+See example/sloan_ordering.cpp.
See Also
-sloan_start_end_vertices,
- bandwidth, profile,
- wavefront and
+
sloan_start_end_vertices,
+ bandwidth, profile,
+ wavefront and
degree_property_map in boost/graph/properties.hpp.
-[1] S. W. Sloan, An algorithm for profile and wavefront reduction of sparse
+
[1] S. W. Sloan, An algorithm for profile and wavefront reduction of sparse
matrices, Int. j. numer. methods eng., 23, 239 - 251 (1986)
-[2] S. W. Sloan, A fortran program for profile and wavefront reduction,
+
[2] S. W. Sloan, A fortran program for profile and wavefront reduction,
Int. j. numer. methods eng., 28, 2651 - 2679 (1989)
diff --git a/doc/small_world_generator.html b/doc/small_world_generator.html
index ed6f1033..e67fd102 100644
--- a/doc/small_world_generator.html
+++ b/doc/small_world_generator.html
@@ -1,11 +1,11 @@
@@ -23,10 +23,10 @@ function address(host, user) {
-
-
+
+
small_world_iterator
@@ -54,7 +54,7 @@ public:
small_world_iterator operator++(int);
bool operator==(const small_world_iterator& other) const;
bool operator!=(const small_world_iterator& other) const;
-};
+};
This class template implements a generator for small-world graphs,
@@ -106,7 +106,7 @@ typedef boost::small_world_iterator<boost::minstd_rand, Graph> SWGen;
int main()
{
boost::minstd_rand gen;
- // Create graph with 100 nodes
+ // Create graph with 100 nodes
Graph g(SWGen(gen, 100, 6, 0.03), SWGen(), 100);
return 0;
}
@@ -123,4 +123,4 @@ Indiana University (
-
-
+
+
sorted_erdos_renyi_iterator
@@ -55,7 +55,7 @@ public:
sorted_erdos_renyi_iterator operator++(int);
bool operator==(const sorted_erdos_renyi_iterator& other) const;
bool operator!=(const sorted_erdos_renyi_iterator& other) const;
-};
+};
This class template implements a generator for Erdös-Renyi
@@ -123,11 +123,11 @@ int main()
| Copyright © 2005 |
Jeremiah Willcock, Indiana University ()
-
+
Doug Gregor, Indiana University ()
Andrew Lumsdaine,
Indiana University ()
|
-
+
diff --git a/doc/sparse_matrix_ordering.html b/doc/sparse_matrix_ordering.html
index 44a6a1bc..ac157616 100644
--- a/doc/sparse_matrix_ordering.html
+++ b/doc/sparse_matrix_ordering.html
@@ -1,17 +1,17 @@
Sparse Matrix Ordering Example
-
-
+
+
@@ -134,24 +134,24 @@ HREF="#fig:ggcl_find_starting_vertex">Figure
namespace boost {
template <class Graph, class Vertex, class Color, class Degree>
- Vertex
+ Vertex
pseudo_peripheral_pair(Graph& G, const Vertex& u, int& ecc,
Color color, Degree degree)
{
typename property_traits<Color>::value_type c = get(color, u);
rcm_queue<Vertex, Degree> Q(degree);
-
+
typename boost::graph_traits<Graph>::vertex_iterator ui, ui_end;
for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui)
put(color, *ui, white(c));
breadth_first_search(G, u, Q, bfs_visitor<>(), color);
- ecc = Q.eccentricity();
+ ecc = Q.eccentricity();
return Q.spouse();
}
-
- template <class Graph, class Vertex, class Color, class Degree>
+
+ template <class Graph, class Vertex, class Color, class Degree>
Vertex find_starting_node(Graph& G, Vertex r, Color c, Degree d) {
int eccen_r, eccen_x;
Vertex x = pseudo_peripheral_pair(G, r, eccen_r, c, d);
@@ -196,12 +196,12 @@ from BGL can be reused.
- template < class Graph, class Vertex, class OutputIterator,
+ template < class Graph, class Vertex, class OutputIterator,
class Color, class Degree >
- inline void
- cuthill_mckee_ordering(Graph& G,
+ inline void
+ cuthill_mckee_ordering(Graph& G,
Vertex s,
- OutputIterator inverse_permutation,
+ OutputIterator inverse_permutation,
Color color, Degree degree)
{
typedef typename property_traits<Degree>::value_type DS;
@@ -212,12 +212,12 @@ from BGL can be reused.
typedef cuthill_mckee_visitor<OutputIterator> CMVisitor;
CMVisitor cm_visitor(inverse_permutation);
-
+
typename boost::graph_traits<Graph>::vertex_iterator ui, ui_end;
for (boost::tie(ui, ui_end) = vertices(G); ui != ui_end; ++ui)
put(color, *ui, white(c));
breadth_first_search(G, s, Q, cm_visitor, color);
- }
+ }
|
@@ -246,18 +246,18 @@ algorithms is as follows:
- Start: Construct undirected graph G0
corresponding to matrix A
-
+
-- Iterate: For k = 1, 2, ... until
+
- Iterate: For k = 1, 2, ... until
Gk = { } do:
-
+
- Choose a vertex vk from Gk
according to some criterion
-- Eliminate vk from Gk to form
+
- Eliminate vk from Gk to form
Gk+1
-
+
@@ -374,4 +374,4 @@ which is to extend partial PSAW in case by case and function
-
+
diff --git a/doc/stanford_graph.html b/doc/stanford_graph.html
index 6e3a77ea..ea578cbe 100644
--- a/doc/stanford_graph.html
+++ b/doc/stanford_graph.html
@@ -9,10 +9,10 @@
-->
Boost Graph Library: Stanford Graph Interface
-
-
+
+
@@ -455,4 +455,4 @@ HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu)
-
+
diff --git a/doc/stoer_wagner_min_cut.html b/doc/stoer_wagner_min_cut.html
index ddd86278..344f488d 100644
--- a/doc/stoer_wagner_min_cut.html
+++ b/doc/stoer_wagner_min_cut.html
@@ -10,7 +10,7 @@
Boost Graph Library: Stoer–Wagner Min-Cut
-
+
@@ -67,7 +67,7 @@ stoer_wagner_min_cut(const UndirectedGraph& g, WeightMap weights,
Expert Parameters
-IN: vertex_index_map(VertexIndexMap vertexIndices)
+
IN: vertex_index_map(VertexIndexMap vertexIndices)
This maps each vertex to an integer in the range [0, num_vertices(g)). This
is only necessary if the default is used for the assignment, index-in-heap, or distance maps.
@@ -92,7 +92,7 @@ stoer_wagner_min_cut(const UndirectedGraph& g, WeightMap weights,
MaxPriorityQueue must be a model of Keyed Updatable Queue
and a max-Updatable Priority Queue.
- The value type must be the graph's vertex descriptor and the key type must be
+ The value type must be the graph's vertex descriptor and the key type must be
the weight type.
Default: A boost::d_ary_heap_indirect using a default index-in-heap
and distance map.
diff --git a/doc/straight_line_drawing.html b/doc/straight_line_drawing.html
index d54e6e71..66c87a29 100644
--- a/doc/straight_line_drawing.html
+++ b/doc/straight_line_drawing.html
@@ -1,17 +1,17 @@
Boost Graph Library: Chrobak-Payne Straight Line Drawing
-
-
+
+
@@ -19,13 +19,13 @@
-template<typename Graph,
- typename PlanarEmbedding,
- typename ForwardIterator,
+template<typename Graph,
+ typename PlanarEmbedding,
+ typename ForwardIterator,
typename PositionMap,
typename VertexIndexMap>
-void chrobak_payne_straight_line_drawing(const Graph& g,
- PlanarEmbedding perm,
+void chrobak_payne_straight_line_drawing(const Graph& g,
+ PlanarEmbedding perm,
ForwardIterator ordering_begin,
ForwardIterator ordering_end,
PositionMap drawing,
@@ -36,14 +36,14 @@ void chrobak_payne_straight_line_drawing(const Graph& g,
A straight line drawing of a
-planar graph is a plane
-drawing where each edge is drawn using a straight line segment. Since all
-edges are line segments, the drawing is completely determined by the placement
-of vertices in the plane. chrobak_payne_straight_line_drawing uses an
-algorithm of Chrobak and Payne
-[71]
-to form a straight
-line drawing of a planar graph by mapping all n vertices in a planar
+planar graph is a plane
+drawing where each edge is drawn using a straight line segment. Since all
+edges are line segments, the drawing is completely determined by the placement
+of vertices in the plane. chrobak_payne_straight_line_drawing uses an
+algorithm of Chrobak and Payne
+[71]
+to form a straight
+line drawing of a planar graph by mapping all n vertices in a planar
graph to integer coordinates in a (2n - 4) x (n - 2) grid.
@@ -51,18 +51,18 @@ graph to integer coordinates in a (2n - 4) x (n - 2) grid.
-The input graph passed to chrobak_payne_straight_line_drawing must
-be a maximal planar graph with at least
-3 vertices. Self-loops and parallel edges are ignored by this function. Note
+The input graph passed to chrobak_payne_straight_line_drawing must
+be a maximal planar graph with at least
+3 vertices. Self-loops and parallel edges are ignored by this function. Note
that the restriction that the graph be maximal planar does not
mean that this function can only draw maximal planar graphs (the graph pictured
-above is not maximal planar, for example). If you want to
-draw a graph g, you can create a copy g' of g, store a
-mapping m of vertices in g' to vertices in g,
-triangulate g', and then send
-g' in as the input to chrobak_payne_straight_line_drawing. The
-drawing returned can then be applied to g using m to translate
-vertices from one graph to another, since g contains a subset of the
+above is not maximal planar, for example). If you want to
+draw a graph g, you can create a copy g' of g, store a
+mapping m of vertices in g' to vertices in g,
+triangulate g', and then send
+g' in as the input to chrobak_payne_straight_line_drawing. The
+drawing returned can then be applied to g using m to translate
+vertices from one graph to another, since g contains a subset of the
edges in g'.
@@ -70,10 +70,10 @@ edges in g'.
Complexity
If the vertex index map provides constant-time access to indices, this
-function takes time O(n + m) for a planar graph with n vertices
-and m edges. Note that
-in a simple planar graph with f faces, m edges, and n
-vertices, both f and m are O(n).
+function takes time O(n + m) for a planar graph with n vertices
+and m edges. Note that
+in a simple planar graph with f faces, m edges, and n
+vertices, both f and m are O(n).
Where Defined
@@ -96,26 +96,26 @@ IN PlanarEmbedding embedding
A Readable Property Map
- that models the PlanarEmbedding
+ that models the PlanarEmbedding
concept.
IN ForwardIterator
-A ForwardIterator that has value_type equal to
+A ForwardIterator that has value_type equal to
graph_traits<Graph>::vertex_descriptor.
-OUT: PositionMap
+OUT: PositionMap
-A Writable LValue Property
+A Writable LValue Property
Map that models the Position Map concept. The Position Map concept requires
that the value mapped to be an object that has members x and
y. For example, if p models PositionMap and v
is a vertex in the graph, p[v].x and p[v].y are valid
-expressions. The type of x and y must be implicitly
+expressions. The type of x and y must be implicitly
convertable to std::size_t.
@@ -123,7 +123,7 @@ IN: VertexIndexMap vm
A Readable Property Map
- that maps vertices from g to distinct integers in the range
+ that maps vertices from g to distinct integers in the range
[0, num_vertices(g) )
Default: get(vertex_index,g)
@@ -151,4 +151,4 @@ A Readable Property Ma
Copyright © 2007 Aaron Windsor (
aaron.windsor@gmail.com)
-
+
diff --git a/doc/strong_components.html b/doc/strong_components.html
index 39c0cc52..b97b7830 100644
--- a/doc/strong_components.html
+++ b/doc/strong_components.html
@@ -1,17 +1,17 @@
Boost Graph Library: Strongly Connected Components
-
-
+
+
@@ -198,4 +198,4 @@ href="../example/strong_components.cpp">examples/strong_components.cpp<
-
+
diff --git a/doc/strong_components.w b/doc/strong_components.w
index 503f4fed..bc96bb02 100644
--- a/doc/strong_components.w
+++ b/doc/strong_components.w
@@ -40,7 +40,7 @@ have a common ancestor in $F$. Also, if $u$ is the common ancestor of
$u$ and $v$ with the latest discover time then $w$ is also in the same
SCC as $u$ and $v$.
-Proof.
+Proof.
If there is a path from $v$ to $w$ and if they are in different DFS
trees, then the discover time for $w$ must be earlier than for $v$.
@@ -76,13 +76,13 @@ following cases:
$u$ in the DFS tree and therefore we have a cycle and $u$ must be in
a SCC with $a$. We then set $root[u] = a$ and continue our way back up
the DFS.
-
+
\item If $a = u$ then we know that $u$ must be the topmost vertex of a
subtree that defines a SCC. All of the vertices in this subtree are
further down on the stack than vertex $u$ so we pop the vertices off
of the stack until we reach $u$ and mark each one as being in the
same component.
-
+
\item If $d[a] > d[u]$ then the adjacent vertices are in different
strongly connected components. We continue our way back up the
DFS.
diff --git a/doc/successive_shortest_path_nonnegative_weights.html b/doc/successive_shortest_path_nonnegative_weights.html
index 434eabbb..b895018e 100644
--- a/doc/successive_shortest_path_nonnegative_weights.html
+++ b/doc/successive_shortest_path_nonnegative_weights.html
@@ -1,17 +1,17 @@
Boost Graph Library: Successive Shortest Path for Min Cost Max Flow
-
-
+
+
@@ -23,34 +23,34 @@
// named parameter version
template <class Graph, class P, class T, class R>
void successive_shortest_path_nonnegative_weights(
- Graph &g,
- typename graph_traits<Graph>::vertex_descriptor s,
+ Graph &g,
+ typename graph_traits<Graph>::vertex_descriptor s,
typename graph_traits<Graph>::vertex_descriptor t,
const bgl_named_params<P, T, R> & params = all defaults)
// non-named parameter version
template <class Graph, class Capacity, class ResidualCapacity, class Reversed, class Pred, class Weight, class Distance, class Distance2, class VertexIndex>
void successive_shortest_path_nonnegative_weights(
- const Graph & g,
- typename graph_traits<Graph>::vertex_descriptor s,
+ const Graph & g,
+ typename graph_traits<Graph>::vertex_descriptor s,
typename graph_traits<Graph>::vertex_descriptor t,
Capacity capacity,
ResidualCapacity residual_capacity,
- Weight weight,
+ Weight weight,
Reversed rev,
VertexIndex index,
- Pred pred,
+ Pred pred,
Distance distance,
- Distance2 distance_prev)
+ Distance2 distance_prev)
The successive_shortest_path_nonnegative_weights() function calculates the minimum cost maximum flow of a network. See Section Network
-Flow Algorithms for a description of maximum flow.
+Flow Algorithms for a description of maximum flow.
The function calculates the flow values f(u,v) for all (u,v) in
E, which are returned in the form of the residual capacity
-r(u,v) = c(u,v) - f(u,v).
+r(u,v) = c(u,v) - f(u,v).
There are several special requirements on the input graph and property
@@ -72,7 +72,7 @@ href="./bibliography.html#ahuja93:_network_flows">Network Flows.
This algorithm starts with empty flow and in each round augments the shortest path (in terms of weight) in the residual graph.
-
+
In order to find the cost of the result flow use:
find_flow_cost().
@@ -98,12 +98,12 @@ IN: vertex_descriptor s
The source vertex for the flow network graph.
-
+
IN: vertex_descriptor t
The sink vertex for the flow network graph.
-
+
Named Parameters
@@ -115,7 +115,7 @@ IN: capacity_map(CapacityEdgeMap cap)
key type of the map must be the graph's edge descriptor type.
Default: get(edge_capacity, g)
-
+
OUT: residual_capacity_map(ResidualCapacityEdgeMap res)
This maps edges to their residual capacity. The type must be a model
@@ -136,11 +136,11 @@ IN: reverse_edge_map(ReverseEdgeMap rev)
Default: get(edge_reverse, g)
-IN: weight_map(WeightMap w_map)
+IN: weight_map(WeightMap w_map)
The weight or ``cost'' of each edge in the graph. The weights
must all be non-negative, and the algorithm will throw a
- negative_edge
+ negative_edge
exception if one of the edges is negative.
The type WeightMap must be a model of
Readable Property Map. The edge descriptor type of
@@ -166,7 +166,7 @@ UTIL: predecessor_map(PredEdgeMap pred)
using the i_map for the index map.
-UTIL: distance_map(DistanceMap d_map)
+UTIL: distance_map(DistanceMap d_map)
The shortest path weight from the source vertex s to each
vertex in the graph g is recorded in this property map. The
@@ -174,7 +174,7 @@ UTIL: distance_map(DistanceMap d_map)
shortest path. The type DistanceMap must be a model of Read/Write
Property Map. The vertex descriptor type of the graph needs to
- be usable as the key type of the distance map.
+ be usable as the key type of the distance map.
Default:
@@ -185,13 +185,13 @@ UTIL: distance_map(DistanceMap d_map)
-UTIL: distance_map2(DistanceMap2 d_map2)
+UTIL: distance_map2(DistanceMap2 d_map2)
The shortest path computation in iteration nr k uses distances computed in iteration k.
The type DistanceMap2 must be a model of Read/Write
Property Map. The vertex descriptor type of the graph needs to
- be usable as the key type of the distance map.
+ be usable as the key type of the distance map.
Default:
@@ -220,7 +220,7 @@ IN: vertex_index_map(VertexIndexMap i_map)
Complexity
-In the integer capacity case, if U is the value of the max flow, then the complexity is O(U * (|E| + |V|*log|V|)),
+In the integer capacity case, if U is the value of the max flow, then the complexity is O(U * (|E| + |V|*log|V|)),
where O(|E| + |V|*log|V|) is the complexity of the dijkstra algorithm and U is upper bound on number of iteration.
In many real world cases number of iterations is much smaller than U.
@@ -244,7 +244,7 @@ Piotr Wygocki, University of Warsaw (wygos a
-
+
Boost Graph Library: time_stamper
-
-
+
+
@@ -193,7 +193,7 @@ HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu)
-
+
Boost Graph Library: Topological Sort
-
-
+
+
@@ -153,4 +153,4 @@ The output is:
-
+
diff --git a/doc/topology.html b/doc/topology.html
index 2eefd237..a2abbd29 100644
--- a/doc/topology.html
+++ b/doc/topology.html
@@ -1,7 +1,7 @@
Boost Graph Library: Transitive Closure
-
-
+
+
@@ -66,7 +66,7 @@ IN: const Graph& g
OUT: GraphTC& tc
A directed graph, where the GraphTC type must model the
- Vertex Mutable Graph
+ Vertex Mutable Graph
and Edge Mutable Graph concepts.
Python: This parameter is not used in Python. Instead, a new
@@ -221,4 +221,4 @@ component of u to any of the vertices in the component of
-
+
diff --git a/doc/transitive_closure.w b/doc/transitive_closure.w
index 136eab68..9e214b3e 100644
--- a/doc/transitive_closure.w
+++ b/doc/transitive_closure.w
@@ -97,7 +97,7 @@ void transitive_closure(const Graph& g, GraphTC& tc)
typedef typename graph_traits::vertex_descriptor tc_vertex;
std::vector to_tc_vec(num_vertices(g));
- iterator_property_map
+ iterator_property_map
g_to_tc_map(&to_tc_vec[0], index_map);
transitive_closure(g, tc, g_to_tc_map, index_map);
@@ -118,7 +118,7 @@ void transitive_closure(const Graph& g, GraphTC& tc,
const bgl_named_params& params)
{
if (num_vertices(g) == 0) return;
- detail::transitive_closure_dispatch(g, tc,
+ detail::transitive_closure_dispatch(g, tc,
get_param(params, orig_to_copy),
choose_const_pmap(get_param(params, vertex_index), g, vertex_index)
);
@@ -132,7 +132,7 @@ mapping or to use the default, a vector, to map between the two.
@d Construct Default G to TC Vertex Mapping
@{
namespace detail {
- template
void transitive_closure_dispatch
@@ -141,7 +141,7 @@ namespace detail {
VertexIndexMap index_map)
{
typedef typename graph_traits::vertex_descriptor tc_vertex;
- typename std::vector::size_type
+ typename std::vector::size_type
n = is_default_param(g_to_tc_map) ? num_vertices(g) : 1;
std::vector to_tc_vec(n);
@@ -192,7 +192,7 @@ the same integer type \code{cg\_vertex} for both.
@{
typedef size_type cg_vertex;
std::vector component_number_vec(num_vertices(g));
-iterator_property_map
+iterator_property_map
component_number(&component_number_vec[0], index_map);
int num_scc = strong_components(g, component_number,
@@ -259,7 +259,7 @@ for (cg_vertex s = 0; s < components.size(); ++s) {
std::sort(adj.begin(), adj.end());
std::vector::iterator di = std::unique(adj.begin(), adj.end());
if (di != adj.end())
- adj.erase(di, adj.end());
+ adj.erase(di, adj.end());
CG[s] = adj;
}
@}
@@ -335,7 +335,7 @@ topological numbers to the vertices.
@{
std::vector topo_order;
std::vector topo_number(num_vertices(CG));
-topological_sort(CG, std::back_inserter(topo_order),
+topological_sort(CG, std::back_inserter(topo_order),
vertex_index_map(identity_property_map()));
std::reverse(topo_order.begin(), topo_order.end());
size_type n = 0;
@@ -354,10 +354,10 @@ returns the topological number of its input argument.
@d Sort the out-edge lists by topological number
@{
for (size_type i = 0; i < num_vertices(CG); ++i)
- std::sort(CG[i].begin(), CG[i].end(),
+ std::sort(CG[i].begin(), CG[i].end(),
compose_f_gx_hy(std::less(),
detail::subscript(topo_number),
- detail::subscript(topo_number)));
+ detail::subscript(topo_number)));
@}
Here is the code that defines the \code{subscript\_t} function object
@@ -366,7 +366,7 @@ and its associated helper object generation function.
@d Subscript function object
@{
namespace detail {
- template
struct subscript_t : public std::unary_function {
subscript_t(Container& c) : container(&c) { }
@@ -443,7 +443,7 @@ for (size_type i = 0; i < chains.size(); ++i)
cg_vertex v = chains[i][j];
chain_number[v] = i;
pos_in_chain[v] = j;
- }
+ }
@}
Now that we have completed the chain decomposition we are ready to
@@ -471,7 +471,7 @@ for (std::vector::reverse_iterator i = topo_order.rbegin();
cg_vertex v = *adj;
if (topo_number[v] < successors[u][chain_number[v]]) {
// Succ(u) = Succ(u) U Succ(v)
- detail::union_successor_sets(successors[u], successors[v],
+ detail::union_successor_sets(successors[u], successors[v],
successors[u]);
// Succ(u) = Succ(u) U {v}
successors[u][chain_number[v]] = topo_number[v];
@@ -490,7 +490,7 @@ vector.
@{
for (size_type i = 0; i < CG.size(); ++i)
CG[i].clear();
-for (size_type i = 0; i < CG.size(); ++i)
+for (size_type i = 0; i < CG.size(); ++i)
for (size_type j = 0; j < chains.size(); ++j) {
size_type topo_num = successors[i][j];
if (topo_num < inf) {
@@ -539,11 +539,11 @@ for (size_type i = 0; i < components.size(); ++i)
add_edge(g_to_tc_map[u], g_to_tc_map[v], tc);
}
-// Find loopbacks in the original graph.
+// Find loopbacks in the original graph.
// Need to add it to transitive closure.
{
vertex_iterator i, i_end;
- for (tie(i, i_end) = vertices(g); i != i_end; ++i)
+ for (tie(i, i_end) = vertices(g); i != i_end; ++i)
{
adjacency_iterator ab, ae;
for (boost::tie(ab, ae) = adjacent_vertices(*i, g); ab != ae; ++ab)
@@ -577,14 +577,14 @@ void warshall_transitive_closure(G& g)
// A[i,j] = A[i,j] | A[k,j]
vertex_iterator ki, ke, ii, ie, ji, je;
for (tie(ki, ke) = vertices(g); ki != ke; ++ki)
- for (tie(ii, ie) = vertices(g); ii != ie; ++ii)
+ for (tie(ii, ie) = vertices(g); ii != ie; ++ii)
if (edge(*ii, *ki, g).second)
for (tie(ji, je) = vertices(g); ji != je; ++ji)
if (!edge(*ii, *ji, g).second &&
edge(*ki, *ji, g).second)
{
add_edge(*ii, *ji, g);
- }
+ }
}
@}
@@ -600,12 +600,12 @@ void warren_transitive_closure(G& g)
BOOST_CONCEPT_ASSERT(( AdjacencyMatrixConcept ));
BOOST_CONCEPT_ASSERT(( EdgeMutableGraphConcept ));
- // Make sure second loop will work
+ // Make sure second loop will work
if (num_vertices(g) == 0)
return;
// for i = 2 to n
- // for k = 1 to i - 1
+ // for k = 1 to i - 1
// if A[i,k]
// for j = 1 to n
// A[i,j] = A[i,j] | A[k,j]
@@ -635,7 +635,7 @@ void warren_transitive_closure(G& g)
edge(*kc, *jc, g).second)
{
add_edge(*ic, *jc, g);
- }
+ }
}
@}
@@ -653,7 +653,7 @@ indent -nut -npcs -i2 -br -cdw -ce transitive_closure.hpp
// Copyright (C) 2001 Vladimir Prus
// Copyright (C) 2001 Jeremy Siek
// Permission to copy, use, modify, sell and distribute this software is
-// granted, provided this copyright notice appears in all copies and
+// granted, provided this copyright notice appears in all copies and
// modified version are clearly marked as such. This software is provided
// "as is" without express or implied warranty, and with no claim as to its
// suitability for any purpose.
diff --git a/doc/transpose_graph.html b/doc/transpose_graph.html
index a8fc62ae..30cf44d4 100644
--- a/doc/transpose_graph.html
+++ b/doc/transpose_graph.html
@@ -1,24 +1,24 @@
Boost Graph Library: Transpose Graph
-
-
+
+
transpose_graph
-template <class VertexListGraph, class MutableGraph>
+template <class VertexListGraph, class MutableGraph>
void transpose_graph(const VertexListGraph& G, MutableGraph& G_T,
const bgl_named_params<P, T, R>& params = all defaults)
@@ -124,4 +124,4 @@ The time complexity is O(V + E).
-
+
diff --git a/doc/trouble_shooting.html b/doc/trouble_shooting.html
index fe20679c..b9108ff7 100644
--- a/doc/trouble_shooting.html
+++ b/doc/trouble_shooting.html
@@ -1,17 +1,17 @@
Boost Graph Library: Trouble Shooting
-
-
+
+
@@ -31,7 +31,7 @@ template instantiation depth. Passing the flag
-error C2784: 'T __cdecl source(struct std::pair,const G &)' :
+error C2784: 'T __cdecl source(struct std::pair,const G &)' :
could not deduce template argument for 'struct std::pair<_T1,_T1>' from
'class boost::detail::bidir_edge'
@@ -44,7 +44,7 @@ using the boost:: prefix, i.e., boost::source(e, g) instead of
../../..\boost/property_map.hpp(283) : error C2678: binary '[' : no operator defined
which takes a left-hand operand of type 'const struct boost::adj_list_edge_property_map,unsigned int,enum boost::edge_weight_t>' (or there is no acceptable conversion)
@@ -126,4 +126,4 @@ HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu)
-
+
diff --git a/doc/undirected_dfs.html b/doc/undirected_dfs.html
index fe81aced..5bbda9de 100644
--- a/doc/undirected_dfs.html
+++ b/doc/undirected_dfs.html
@@ -1,17 +1,17 @@
Boost Graph Library: Undirected Depth-First Search
-
-
+
+
@@ -90,36 +90,36 @@ be used to do this.
DFS(G)
- for each vertex u in V
+ for each vertex u in V
vcolor[u] := WHITE
- p[u] := u
+ p[u] := u
end for
- for each edge e in E
+ for each edge e in E
ecolor[u] := WHITE
end for
time := 0
if there is a starting vertex s
call DFS-VISIT(G, s)
- for each vertex u in V
+ for each vertex u in V
if vcolor[u] = WHITE
call DFS-VISIT(G, u)
end for
return (p,d_time,f_time)
-DFS-VISIT(G, u)
+DFS-VISIT(G, u)
vcolor[u] := GRAY
- d_time[u] := time := time + 1
- for each e in Out[u]
+ d_time[u] := time := time + 1
+ for each e in Out[u]
var ec := ecolor[e]
ecolor[e] := BLACK
if (vcolor[v] = WHITE)
- p[v] := u
+ p[v] := u
call DFS-VISIT(G, v)
else if (vcolor[v] = GRAY and ec = WHITE)
...
...
end for
vcolor[u] := BLACK
- f_time[u] := time := time + 1
+ f_time[u] := time := time + 1
|
@@ -178,7 +178,7 @@ IN: Graph& g
Vertex List Graph,
and Edge List Graph.
- Python: The parameter is named graph.
+ Python: The parameter is named graph.
@@ -280,22 +280,22 @@ The time complexity is O(E + V).
- vis.start_vertex(s, g) is invoked on the source
vertex once before the start of the search.
-
+
- vis.discover_vertex(u, g) is invoked when a vertex
is encountered for the first time.
-
+
- vis.examine_edge(e, g) is invoked on every out-edge
of each vertex after it is discovered.
- vis.tree_edge(e, g) is invoked on each edge as it
becomes a member of the edges that form the search tree. If you
wish to record predecessors, do so at this event point.
-
-
- vis.back_edge(e, g) is invoked on the back edges in
- the graph.
-
- vis.finish_edge(e, g) is invoked on the back edges in
- the graph as well as on each tree edge after its target vertex is finished.
+
- vis.back_edge(e, g) is invoked on the back edges in
+ the graph.
+
+
- vis.finish_edge(e, g) is invoked on the back edges in
+ the graph as well as on each tree edge after its target vertex is finished.
- vis.finish_vertex(u, g) is invoked on a vertex after
all of its out edges have been added to the search tree and all of
@@ -317,7 +317,7 @@ An example is in
Notes
-[1]
+ [1]
Since the visitor parameter is passed by value, if your visitor
contains state then any changes to the state during the algorithm
will be made to a copy of the visitor object, not the visitor object
@@ -339,4 +339,4 @@ HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu )
|
-
+
diff --git a/doc/users.html b/doc/users.html
index 5c154f28..7cbdda97 100644
--- a/doc/users.html
+++ b/doc/users.html
@@ -1,16 +1,16 @@
Boost Graph Library Users
-
-
+
+
Boost Graph Library Users
diff --git a/doc/using_adjacency_list.html b/doc/using_adjacency_list.html
index 1d3de094..45772144 100644
--- a/doc/using_adjacency_list.html
+++ b/doc/using_adjacency_list.html
@@ -1,17 +1,17 @@
Using the Boost Graph Library
-
-
+
+
@@ -134,11 +134,11 @@ out-edges for the whole graph.
vertex()
This operation is constant time for vecS and for
-listS.
+listS.
-
+
-
+
-
@@ -312,7 +312,7 @@ the OutEdgeList selection.
-
+
@@ -344,16 +344,16 @@ parameters VertexProperty and EdgeProperty of the
adjacency_list class are meant to be filled by these interior
properties.
-NOTE: The Boost Graph Library supports two interchangeable methods for
-specifying interior properties: bundled properties
-and property lists. The former is easier to use and requires less effort,
-whereas the latter is compatible with older, broken compilers and is
+
NOTE: The Boost Graph Library supports two interchangeable methods for
+specifying interior properties: bundled properties
+and property lists. The former is easier to use and requires less effort,
+whereas the latter is compatible with older, broken compilers and is
backward-compatible with Boost versions prior to 1.32.0. If you absolutely
-require these compatibility features, read on to learn about property lists.
+require these compatibility features, read on to learn about property lists.
Otherwise, we strongly suggest that you read about the bundled
properties mechanism.
-
One may specify internal properties via property lists, which are build from instances of the
+
One may specify internal properties via property lists, which are build from instances of the
property class declared as follows.
@@ -427,11 +427,11 @@ the edges of the graph.
- typedef property<vertex_distance_t, float,
+ typedef property<vertex_distance_t, float,
property<vertex_name_t, std::string> > VertexProperty;
typedef property<edge_weight_t, float> EdgeProperty;
- typedef adjacency_list<mapS, vecS, undirectedS,
+ typedef adjacency_list<mapS, vecS, undirectedS,
VertexProperty, EdgeProperty> Graph;
Graph g(num_vertices); // construct a graph object
@@ -464,7 +464,7 @@ struct flow_t {
typedef edge_property_tag kind;
};
-struct capacity_t {
+struct capacity_t {
typedef edge_property_tag kind;
};
@@ -545,28 +545,28 @@ owes who''.
typedef property<first_name_t, std::string> FirstNameProperty;
- typedef adjacency_list<vecS, vecS, directedS,
+ typedef adjacency_list<vecS, vecS, directedS,
FirstNameProperty> MyGraphType;
typedef pair<int,int> Pair;
- Pair edge_array[11] = { Pair(0,1), Pair(0,2), Pair(0,3),
- Pair(0,4), Pair(2,0), Pair(3,0),
- Pair(2,4), Pair(3,1), Pair(3,4),
+ Pair edge_array[11] = { Pair(0,1), Pair(0,2), Pair(0,3),
+ Pair(0,4), Pair(2,0), Pair(3,0),
+ Pair(2,4), Pair(3,1), Pair(3,4),
Pair(4,0), Pair(4,1) };
-
+
MyGraphType G(5);
for (int i = 0; i < 11; ++i)
add_edge(edge_array[i].first, edge_array[i].second, G);
property_map<MyGraphType, first_name_t>::type
name = get(first_name_t(), G);
-
+
boost::put(name, 0, "Jeremy");
boost::put(name, 1, "Rich");
boost::put(name, 2, "Andrew");
boost::put(name, 3, "Jeff");
name[4] = "Kinis"; // you can use operator[] too
-
+
who_owes_who(edges(G).first, edges(G).second, G);
@@ -589,7 +589,7 @@ other property value types.
void who_owes_who(EdgeIter first, EdgeIter last, const Graph& G)
{
// Access the propety acessor type for this graph
- typedef typename property_map<Graph,
+ typedef typename property_map<Graph,
first_name_t>::const_type NameMap;
NameMap name = get(first_name, G);
@@ -601,7 +601,7 @@ other property value types.
while (first != last) {
src_name = boost::get(name, source(*first, G));
targ_name = boost::get(name, target(*first, G));
- cout << src_name << " owes "
+ cout << src_name << " owes "
<< targ_name << " some money" << endl;
++first;
}
@@ -712,8 +712,8 @@ to be used with the std::list.
};
}
- // now you can define a graph using std::list
- // and a specific allocator
+ // now you can define a graph using std::list
+ // and a specific allocator
typedef adjacency_list< list_with_allocatorS< std::allocator<int> >, vecS, directedS> MyGraph;
@@ -769,7 +769,7 @@ href="http://www.boost.org/sgi/stl/AssociativeContainer.html">AssociativeContain
template <>
- struct parallel_edge_traits<custom_containerS> {
+ struct parallel_edge_traits<custom_containerS> {
typedef allow_parallel_edge_tag type;
};
@@ -784,4 +784,4 @@ href="http://www.boost.org/sgi/stl/AssociativeContainer.html">AssociativeContain
-
+
diff --git a/doc/using_property_maps.html b/doc/using_property_maps.html
index 661e66e0..80da3e62 100644
--- a/doc/using_property_maps.html
+++ b/doc/using_property_maps.html
@@ -1,17 +1,17 @@
Boost Graph Library: Using Property Maps
-
-
+
+
@@ -59,10 +59,10 @@ function then returns the property value for the vertex.
template <class Edge, class Graph,
- class WeightPropertyMap,
+ class WeightPropertyMap,
class DistancePropertyMap>
- bool relax(Edge e, const Graph& g,
- WeightPropertyMap weight,
+ bool relax(Edge e, const Graph& g,
+ WeightPropertyMap weight,
DistancePropertyMap distance)
{
typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
@@ -107,14 +107,14 @@ variables of the distance property type.
-There are two kinds of graph properties: interior and exterior.
+There are two kinds of graph properties: interior and exterior.
- Interior Properties
- are stored ``inside'' the graph object
in some way, and the lifetime of the property value objects is the
-same as that of the graph object.
+same as that of the graph object.
@@ -174,7 +174,7 @@ graph, so one would call Dijkstra's algorithm in the following way
- dijkstra_shortest_paths(g, src,
+ dijkstra_shortest_paths(g, src,
distance_map(get(vertex_distance, g)).
weight_map(get(edge_weight, g)).
color_map(get(vertex_color, g)).
@@ -240,7 +240,7 @@ the flow and capacity values.
- typedef adjacency_list<vecS, vecS, bidirectionalS,
+ typedef adjacency_list<vecS, vecS, bidirectionalS,
no_property, property<edge_index_t, std::size_t> > Graph;
const int num_vertices = 9;
@@ -258,8 +258,8 @@ the flow and capacity values.
EdgeID_Map edge_id = get(edge_index, G);
iterator_property_map
- <int*, int, int&, EdgeID_Map>
- capacity(capacity_array, edge_id),
+ <int*, int, int&, EdgeID_Map>
+ capacity(capacity_array, edge_id),
flow(flow_array, edge_id);
print_network(G, capacity, flow);
@@ -337,7 +337,7 @@ int main(int,char*[])
// An array of vertex name properties
std::string names[] = { "San Jose", "San Francisco", "San Jose",
- "San Francisco", "Los Angeles", "San Diego",
+ "San Francisco", "Los Angeles", "San Diego",
"Fresno", "Los Vegas", "Reno", "Sacramento",
"Salt Lake City", "Pheonix" };
@@ -359,7 +359,7 @@ int main(int,char*[])
cout << endl;
// Get the source vertex
- boost::graph_traits<Graph>::vertex_descriptor
+ boost::graph_traits<Graph>::vertex_descriptor
s = vertex(SanJose, G);
cout << "*** Breadth First ***" << endl;
@@ -414,12 +414,12 @@ since we plan on implementing the at() function.
class iterator_map
{
public:
- typedef typename boost::property_traits<IDMap>::key_type key_type;
+ typedef typename boost::property_traits<IDMap>::key_type key_type;
typedef typename std::iterator_traits<Iterator>::value_type value_type;
typedef boost::lvalue_property_map_tag category;
- iterator_map(Iterator i = Iterator(),
- const IDMap& id = IDMap())
+ iterator_map(Iterator i = Iterator(),
+ const IDMap& id = IDMap())
: m_iter(i), m_id(id) { }
Iterator m_iter;
IDMap m_id;
@@ -477,4 +477,4 @@ previous section.
-
+
diff --git a/doc/vf2_sub_graph_iso.html b/doc/vf2_sub_graph_iso.html
index 41b32e16..66fc766c 100644
--- a/doc/vf2_sub_graph_iso.html
+++ b/doc/vf2_sub_graph_iso.html
@@ -1,8 +1,8 @@
Boost Graph Library: Visitor Concepts
-
-
+
+
@@ -60,4 +60,4 @@ HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu)
-
+
diff --git a/doc/wavefront.htm b/doc/wavefront.htm
index bfc0928e..f6a3b651 100644
--- a/doc/wavefront.htm
+++ b/doc/wavefront.htm
@@ -10,7 +10,7 @@
-->
-
ith_wavefront
(1)
@@ -23,8 +23,8 @@
Defined in
-boost/graph/wavefront.hpp
+boost/graph/wavefront.hpp
max_wavefront
@@ -36,8 +36,8 @@ href="http://www.boost.org/boost/graph/wavefront.hpp">boost/graph/wavefront.
Calculates the maximum wavefront a graph.
Defined in
-boost/graph/wavefront.hpp
+
boost/graph/wavefront.hpp
aver_wavefront
@@ -46,12 +46,12 @@ href="http://www.boost.org/boost/graph/wavefront.hpp">boost/graph/wavefront.
(2)
template <typename Graph, typename VertexIndexMap>
typename graph_traits<Graph>::vertices_size_type
aver_wavefront(const Graph& g, VertexIndexMap index)
-Calculates the average wavefront of a graph (sum of all wavefronts devided by
+Calculates the average wavefront of a graph (sum of all wavefronts devided by
the number ob vertices).
Defined in
-boost/graph/wavefront.hpp
+boost/graph/wavefront.hpp
@@ -64,15 +64,15 @@ href="http://www.boost.org/boost/graph/wavefront.hpp">boost/graph/wavefront.
Calculates the root mean square of all wavefronts.
Defined in
-boost/graph/wavefront.hpp
+boost/graph/wavefront.hpp
diff --git a/doc/write_dimacs.html b/doc/write_dimacs.html
index 9a6e8066..f10af48a 100644
--- a/doc/write_dimacs.html
+++ b/doc/write_dimacs.html
@@ -35,10 +35,10 @@
Boost Graph Library: write_dimacs_max_flow
-
-
+
+
+
IN: CapacityMap capacity
A property map that models Readable Property Map whose key type is the edge descriptor of the graph and whose value type can be written to a stream.
-
+
IN: IndexMap epw
A property map that models Readable Property Map whose key type is the vertex descriptor of the graph and whose value type can be written to a stream.
-
+
OUT: std::ostream& out
A standard std::ostream object.
-
+
-Example
+Example
A short example which uses read_dimacs and write_dimacs is located in the examples directory.
@@ -101,4 +101,4 @@ A short example which uses rea
Notes
[1] As num_edges() and num_vertices() is used inside which returns values for the unfiltered graph (instead of the filtered), this method cannot be used with a filtered_graphSee filtered_graph Note [2] for the reason.
-
+
diff --git a/doc/write_graphml.rst b/doc/write_graphml.rst
index 00e68b7d..ec229ae0 100644
--- a/doc/write_graphml.rst
+++ b/doc/write_graphml.rst
@@ -3,11 +3,11 @@
============================
.. Copyright (C) 2006 Tiago de Paula Peixoto
-
+
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)
-
+
Authors: Tiago de Paula Peixoto
.. |(logo)| image:: ../../../boost.png
@@ -20,7 +20,7 @@ __ ../../../index.htm
template
void
- write_graphml(std::ostream& out, const Graph& g, const dynamic_properties& dp,
+ write_graphml(std::ostream& out, const Graph& g, const dynamic_properties& dp,
bool ordered_vertices=false);
template
@@ -48,7 +48,7 @@ Parameters
OUT: ``std::ostream& out``
A standard ``std::ostream`` object.
-IN: ``VertexListGraph& g``
+IN: ``VertexListGraph& g``
A directed or undirected graph. The
graph's type must be a model of VertexListGraph_. If the graph
doesn't have an internal ``vertex_index`` property map, one
@@ -74,7 +74,7 @@ IN: ``bool ordered_vertices``
Example
-------
-This example demonstrates using BGL-GraphML interface to write
+This example demonstrates using BGL-GraphML interface to write
a BGL graph into a GraphML format file.
::
diff --git a/example/accum-compile-times.cpp b/example/accum-compile-times.cpp
index d4db2cf4..cc0d48fd 100644
--- a/example/accum-compile-times.cpp
+++ b/example/accum-compile-times.cpp
@@ -1,5 +1,5 @@
//=======================================================================
-// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
+// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
@@ -16,80 +16,85 @@
namespace std
{
- template < typename T >
- std::istream& operator >> (std::istream& in, std::pair < T, T > &p)
- {
+template < typename T >
+std::istream& operator>>(std::istream& in, std::pair< T, T >& p)
+{
in >> p.first >> p.second;
return in;
- }
+}
}
namespace boost
{
- enum vertex_compile_cost_t { vertex_compile_cost };
- BOOST_INSTALL_PROPERTY(vertex, compile_cost);
+enum vertex_compile_cost_t
+{
+ vertex_compile_cost
+};
+BOOST_INSTALL_PROPERTY(vertex, compile_cost);
}
using namespace boost;
typedef adjacency_list< listS, // Store out-edges of each vertex in a std::list
- listS, // Store vertex set in a std::list
- directedS, // The file dependency graph is directed
- // vertex properties
- property < vertex_name_t, std::string,
- property < vertex_compile_cost_t, float,
- property < vertex_distance_t, float,
- property < vertex_color_t, default_color_type > > > >,
- // an edge property
- property < edge_weight_t, float > >
- file_dep_graph2;
+ listS, // Store vertex set in a std::list
+ directedS, // The file dependency graph is directed
+ // vertex properties
+ property< vertex_name_t, std::string,
+ property< vertex_compile_cost_t, float,
+ property< vertex_distance_t, float,
+ property< vertex_color_t, default_color_type > > > >,
+ // an edge property
+ property< edge_weight_t, float > >
+ file_dep_graph2;
-typedef graph_traits::vertex_descriptor vertex_t;
-typedef graph_traits::edge_descriptor edge_t;
+typedef graph_traits< file_dep_graph2 >::vertex_descriptor vertex_t;
+typedef graph_traits< file_dep_graph2 >::edge_descriptor edge_t;
-int
-main(int argc, const char** argv)
+int main(int argc, const char** argv)
{
- std::ifstream file_in(argc >= 2 ? argv[1] : "makefile-dependencies.dat");
- typedef graph_traits::vertices_size_type size_type;
- size_type n_vertices;
- file_in >> n_vertices; // read in number of vertices
+ 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
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
- // std::istream_iterator causes trouble with VC++
- std::vector id2vertex;
- file_dep_graph2 g;
- for (std::size_t i = 0; i < n_vertices; ++i)
- id2vertex.push_back(add_vertex(g));
- std::pair p;
- while (file_in >> p)
- add_edge(id2vertex[p.first], id2vertex[p.second], g);
+ // std::istream_iterator causes trouble with VC++
+ std::vector< vertex_t > id2vertex;
+ file_dep_graph2 g;
+ for (std::size_t i = 0; i < n_vertices; ++i)
+ id2vertex.push_back(add_vertex(g));
+ std::pair< size_type, size_type > p;
+ while (file_in >> p)
+ add_edge(id2vertex[p.first], id2vertex[p.second], g);
#else
- std::istream_iterator >
- input_begin(file_in), input_end;
- file_dep_graph2 g(input_begin, input_end, n_vertices);
+ std::istream_iterator< std::pair< size_type, size_type > > input_begin(
+ file_in),
+ input_end;
+ file_dep_graph2 g(input_begin, input_end, n_vertices);
#endif
- 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< 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;
- name_map_t name_map = get(vertex_name, g);
- compile_cost_map_t compile_cost_map = get(vertex_compile_cost, g);
+ 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(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];
- compile_cost_in >> compile_cost_map[*vi];
- }
+ 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];
+ compile_cost_in >> compile_cost_map[*vi];
+ }
- graph_property_iter_range < file_dep_graph2,
- vertex_compile_cost_t >::iterator ci, ci_end;
- boost::tie(ci, ci_end) = get_property_iter_range(g, vertex_compile_cost);
- std::cout << "total (sequential) compile time: "
- << std::accumulate(ci, ci_end, 0.0) << std::endl;
+ graph_property_iter_range< file_dep_graph2,
+ vertex_compile_cost_t >::iterator ci,
+ ci_end;
+ boost::tie(ci, ci_end) = get_property_iter_range(g, vertex_compile_cost);
+ std::cout << "total (sequential) compile time: "
+ << std::accumulate(ci, ci_end, 0.0) << std::endl;
- return 0;
+ return 0;
}
-
diff --git a/example/actor_clustering.cpp b/example/actor_clustering.cpp
index 9b1b4022..5564a9e9 100644
--- a/example/actor_clustering.cpp
+++ b/example/actor_clustering.cpp
@@ -29,159 +29,191 @@ using namespace boost;
struct Actor
{
- Actor(int id = -1) : id(id) {}
+ Actor(int id = -1) : id(id) {}
- int id;
+ int id;
};
-typedef adjacency_list > ActorGraph;
-typedef graph_traits::vertex_descriptor Vertex;
-typedef graph_traits::edge_descriptor Edge;
+typedef adjacency_list< vecS, vecS, undirectedS, Actor,
+ property< edge_centrality_t, double > >
+ ActorGraph;
+typedef graph_traits< ActorGraph >::vertex_descriptor Vertex;
+typedef graph_traits< ActorGraph >::edge_descriptor Edge;
void load_actor_graph(std::istream& in, ActorGraph& g)
{
- std::map actors;
+ std::map< int, Vertex > actors;
- std::string line;
- while (getline(in, line)) {
- std::vector actors_in_movie;
+ std::string line;
+ while (getline(in, line))
+ {
+ std::vector< Vertex > actors_in_movie;
- // Map from the actor numbers on this line to the actor vertices
- typedef tokenizer > Tok;
- Tok tok(line, char_separator(" "));
- for (Tok::iterator id = tok.begin(); id != tok.end(); ++id) {
- int actor_id = lexical_cast(*id);
- std::map::iterator v = actors.find(actor_id);
- if (v == actors.end()) {
- Vertex new_vertex = add_vertex(Actor(actor_id), g);
- actors[actor_id] = new_vertex;
- actors_in_movie.push_back(new_vertex);
- } else {
- actors_in_movie.push_back(v->second);
- }
+ // Map from the actor numbers on this line to the actor vertices
+ typedef tokenizer< char_separator< char > > Tok;
+ Tok tok(line, char_separator< char >(" "));
+ for (Tok::iterator id = tok.begin(); id != tok.end(); ++id)
+ {
+ int actor_id = lexical_cast< int >(*id);
+ std::map< int, Vertex >::iterator v = actors.find(actor_id);
+ if (v == actors.end())
+ {
+ Vertex new_vertex = add_vertex(Actor(actor_id), g);
+ actors[actor_id] = new_vertex;
+ actors_in_movie.push_back(new_vertex);
+ }
+ else
+ {
+ actors_in_movie.push_back(v->second);
+ }
+ }
+
+ for (std::vector< Vertex >::iterator i = actors_in_movie.begin();
+ i != actors_in_movie.end(); ++i)
+ {
+ for (std::vector< Vertex >::iterator j = i + 1;
+ j != actors_in_movie.end(); ++j)
+ {
+ if (!edge(*i, *j, g).second)
+ add_edge(*i, *j, g);
+ }
+ }
}
-
- for (std::vector::iterator i = actors_in_movie.begin();
- i != actors_in_movie.end(); ++i) {
- for (std::vector::iterator j = i + 1;
- j != actors_in_movie.end(); ++j) {
- if (!edge(*i, *j, g).second) add_edge(*i, *j, g);
- }
- }
- }
}
-template
-std::ostream&
-write_pajek_graph(std::ostream& out, const Graph& g,
- VertexIndexMap vertex_index, VertexNameMap vertex_name)
+template < typename Graph, typename VertexIndexMap, typename VertexNameMap >
+std::ostream& write_pajek_graph(std::ostream& out, const Graph& g,
+ VertexIndexMap vertex_index, VertexNameMap vertex_name)
{
- out << "*Vertices " << num_vertices(g) << '\n';
- typedef typename graph_traits::vertex_iterator vertex_iterator;
- for (vertex_iterator v = vertices(g).first; v != vertices(g).second; ++v) {
- out << get(vertex_index, *v)+1 << " \"" << get(vertex_name, *v) << "\"\n";
- }
+ out << "*Vertices " << num_vertices(g) << '\n';
+ typedef typename graph_traits< Graph >::vertex_iterator vertex_iterator;
+ for (vertex_iterator v = vertices(g).first; v != vertices(g).second; ++v)
+ {
+ out << get(vertex_index, *v) + 1 << " \"" << get(vertex_name, *v)
+ << "\"\n";
+ }
- out << "*Edges\n";
- typedef typename graph_traits::edge_iterator edge_iterator;
- for (edge_iterator e = edges(g).first; e != edges(g).second; ++e) {
- out << get(vertex_index, source(*e, g))+1 << ' '
- << get(vertex_index, target(*e, g))+1 << " 1.0\n"; // HACK!
- }
- return out;
+ out << "*Edges\n";
+ typedef typename graph_traits< Graph >::edge_iterator edge_iterator;
+ for (edge_iterator e = edges(g).first; e != edges(g).second; ++e)
+ {
+ out << get(vertex_index, source(*e, g)) + 1 << ' '
+ << get(vertex_index, target(*e, g)) + 1 << " 1.0\n"; // HACK!
+ }
+ return out;
}
-class actor_clustering_threshold : public bc_clustering_threshold
+class actor_clustering_threshold : public bc_clustering_threshold< double >
{
- typedef bc_clustering_threshold inherited;
+ typedef bc_clustering_threshold< double > inherited;
- public:
- actor_clustering_threshold(double threshold, const ActorGraph& g,
- bool normalize)
- : inherited(threshold, g, normalize), iter(1) { }
+public:
+ actor_clustering_threshold(
+ double threshold, const ActorGraph& g, bool normalize)
+ : inherited(threshold, g, normalize), iter(1)
+ {
+ }
- bool operator()(double max_centrality, Edge e, const ActorGraph& g)
- {
- std::cout << "Iter: " << iter << " Max Centrality: "
- << (max_centrality / dividend) << std::endl;
- ++iter;
- return inherited::operator()(max_centrality, e, g);
- }
+ bool operator()(double max_centrality, Edge e, const ActorGraph& g)
+ {
+ std::cout << "Iter: " << iter
+ << " Max Centrality: " << (max_centrality / dividend)
+ << std::endl;
+ ++iter;
+ return inherited::operator()(max_centrality, e, g);
+ }
- private:
- unsigned int iter;
+private:
+ unsigned int iter;
};
int main(int argc, char* argv[])
{
- std::string in_file;
- std::string out_file;
- double threshold = -1.0;
- bool normalize = false;
+ std::string in_file;
+ std::string out_file;
+ double threshold = -1.0;
+ bool normalize = false;
- // Parse command-line options
- {
- int on_arg = 1;
- while (on_arg < argc) {
- std::string arg(argv[on_arg]);
- if (arg == "-in") {
- ++on_arg; assert(on_arg < argc);
- in_file = argv[on_arg];
- } else if (arg == "-out") {
- ++on_arg; assert(on_arg < argc);
- out_file = argv[on_arg];
- } else if (arg == "-threshold") {
- ++on_arg; assert(on_arg < argc);
- threshold = lexical_cast(argv[on_arg]);
- } else if (arg == "-normalize") {
- normalize = true;
- } else {
- std::cerr << "Unrecognized parameter \"" << arg << "\".\n";
- return -1;
- }
- ++on_arg;
+ // Parse command-line options
+ {
+ int on_arg = 1;
+ while (on_arg < argc)
+ {
+ std::string arg(argv[on_arg]);
+ if (arg == "-in")
+ {
+ ++on_arg;
+ assert(on_arg < argc);
+ in_file = argv[on_arg];
+ }
+ else if (arg == "-out")
+ {
+ ++on_arg;
+ assert(on_arg < argc);
+ out_file = argv[on_arg];
+ }
+ else if (arg == "-threshold")
+ {
+ ++on_arg;
+ assert(on_arg < argc);
+ threshold = lexical_cast< double >(argv[on_arg]);
+ }
+ else if (arg == "-normalize")
+ {
+ normalize = true;
+ }
+ else
+ {
+ std::cerr << "Unrecognized parameter \"" << arg << "\".\n";
+ return -1;
+ }
+ ++on_arg;
+ }
+
+ if (in_file.empty() || out_file.empty() || threshold < 0)
+ {
+ std::cerr << "error: syntax is actor_clustering [options]\n\n"
+ << "options are:\n"
+ << "\t-in \tInput file\n"
+ << "\t-out \tOutput file\n"
+ << "\t-threshold \tA threshold value\n"
+ << "\t-normalize\tNormalize edge centrality scores\n";
+ return -1;
+ }
}
- if (in_file.empty() || out_file.empty() || threshold < 0) {
- std::cerr << "error: syntax is actor_clustering [options]\n\n"
- << "options are:\n"
- << "\t-in \tInput file\n"
- << "\t-out \tOutput file\n"
- << "\t-threshold \tA threshold value\n"
- << "\t-normalize\tNormalize edge centrality scores\n";
- return -1;
+ ActorGraph g;
+
+ // Load the actor graph
+ {
+ std::cout << "Building graph." << std::endl;
+ std::ifstream in(in_file.c_str());
+ if (!in)
+ {
+ std::cerr << "Unable to open file \"" << in_file
+ << "\" for input.\n";
+ return -2;
+ }
+ load_actor_graph(in, g);
}
- }
- ActorGraph g;
+ // Run the algorithm
+ std::cout << "Clusting..." << std::endl;
+ betweenness_centrality_clustering(g,
+ actor_clustering_threshold(threshold, g, normalize),
+ get(edge_centrality, g));
- // Load the actor graph
- {
- std::cout << "Building graph." << std::endl;
- std::ifstream in(in_file.c_str());
- if (!in) {
- std::cerr << "Unable to open file \"" << in_file << "\" for input.\n";
- return -2;
+ // Output the graph
+ {
+ std::cout << "Writing graph to file: " << out_file << std::endl;
+ std::ofstream out(out_file.c_str());
+ if (!out)
+ {
+ std::cerr << "Unable to open file \"" << out_file
+ << "\" for output.\n";
+ return -3;
+ }
+ write_pajek_graph(out, g, get(vertex_index, g), get(&Actor::id, g));
}
- load_actor_graph(in, g);
- }
-
- // Run the algorithm
- std::cout << "Clusting..." << std::endl;
- betweenness_centrality_clustering(g,
- actor_clustering_threshold(threshold, g, normalize),
- get(edge_centrality, g));
-
- // Output the graph
- {
- std::cout << "Writing graph to file: " << out_file << std::endl;
- std::ofstream out(out_file.c_str());
- if (!out) {
- std::cerr << "Unable to open file \"" << out_file << "\" for output.\n";
- return -3;
- }
- write_pajek_graph(out, g, get(vertex_index, g), get(&Actor::id, g));
- }
- return 0;
+ return 0;
}
diff --git a/example/adj_list_ra_edgelist.cpp b/example/adj_list_ra_edgelist.cpp
index d92ecd66..d6380efa 100644
--- a/example/adj_list_ra_edgelist.cpp
+++ b/example/adj_list_ra_edgelist.cpp
@@ -11,25 +11,26 @@
#include
#include
-int
-main()
+int main()
{
- using namespace boost;
- typedef adjacency_list, no_property, vecS> Graph;
+ using namespace boost;
+ typedef adjacency_list< vecS, vecS, bidirectionalS, no_property,
+ property< int, edge_weight_t >, no_property, vecS >
+ Graph;
- const std::size_t n = 3;
- typedef std::pair E;
- 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);
+ const std::size_t n = 3;
+ typedef std::pair< std::size_t, std::size_t > E;
+ 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);
- 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;
+ graph_traits< Graph >::edge_iterator edge_iterator;
+ for (std::size_t i = 0; i < m; ++i)
+ {
+ const graph_traits< Graph >::edge_iterator e = edges(g).first + i;
+ std::cout << *e << " ";
+ }
+ std::cout << std::endl;
+
+ return 0;
}
diff --git a/example/adjacency_list.cpp b/example/adjacency_list.cpp
index 6d805379..916a98c0 100644
--- a/example/adjacency_list.cpp
+++ b/example/adjacency_list.cpp
@@ -20,88 +20,92 @@
Sample Output
graph name: foo
- 0 --joe--> 1
- 1 --joe--> 0 --curly--> 2 --dick--> 3
- 2 --curly--> 1 --tom--> 4
- 3 --dick--> 1 --harry--> 4
- 4 --tom--> 2 --harry--> 3
- (0,1) (1,2) (1,3) (2,4) (3,4)
+ 0 --joe--> 1
+ 1 --joe--> 0 --curly--> 2 --dick--> 3
+ 2 --curly--> 1 --tom--> 4
+ 3 --dick--> 1 --harry--> 4
+ 4 --tom--> 2 --harry--> 3
+ (0,1) (1,2) (1,3) (2,4) (3,4)
- removing edge (1,3):
- 0 --joe--> 1
- 1 --joe--> 0 --curly--> 2
- 2 --curly--> 1 --tom--> 4
- 3 --harry--> 4
- 4 --tom--> 2 --harry--> 3
- (0,1) (1,2) (2,4) (3,4)
+ removing edge (1,3):
+ 0 --joe--> 1
+ 1 --joe--> 0 --curly--> 2
+ 2 --curly--> 1 --tom--> 4
+ 3 --harry--> 4
+ 4 --tom--> 2 --harry--> 3
+ (0,1) (1,2) (2,4) (3,4)
*/
-struct EdgeProperties {
- EdgeProperties(const std::string& n) : name(n) { }
- std::string name;
-};
-
-struct VertexProperties {
- std::size_t index;
- boost::default_color_type color;
-};
-
-
-int main(int , char* [])
+struct EdgeProperties
{
- using namespace boost;
- using namespace std;
+ EdgeProperties(const std::string& n) : name(n) {}
+ std::string name;
+};
- typedef adjacency_list Graph;
+struct VertexProperties
+{
+ std::size_t index;
+ boost::default_color_type color;
+};
- const int V = 5;
- Graph g(V);
+int main(int, char*[])
+{
+ using namespace boost;
+ using namespace std;
- property_map::type
- id = get(&VertexProperties::index, g);
- property_map::type
- name = get(&EdgeProperties::name, g);
+ typedef adjacency_list< vecS, listS, undirectedS, VertexProperties,
+ EdgeProperties >
+ Graph;
- boost::graph_traits::vertex_iterator vi, viend;
- int vnum = 0;
+ const int V = 5;
+ Graph g(V);
- for (boost::tie(vi,viend) = vertices(g); vi != viend; ++vi)
- id[*vi] = vnum++;
+ property_map< Graph, std::size_t VertexProperties::* >::type id
+ = get(&VertexProperties::index, g);
+ property_map< Graph, std::string EdgeProperties::* >::type name
+ = get(&EdgeProperties::name, g);
- add_edge(vertex(0, g), vertex(1, g), EdgeProperties("joe"), g);
- add_edge(vertex(1, g), vertex(2, g), EdgeProperties("curly"), g);
- add_edge(vertex(1, g), vertex(3, g), EdgeProperties("dick"), g);
- add_edge(vertex(2, g), vertex(4, g), EdgeProperties("tom"), g);
- add_edge(vertex(3, g), vertex(4, g), EdgeProperties("harry"), g);
+ boost::graph_traits< Graph >::vertex_iterator vi, viend;
+ int vnum = 0;
- graph_traits::vertex_iterator i, end;
- graph_traits::out_edge_iterator ei, edge_end;
- for (boost::tie(i,end) = vertices(g); i != end; ++i) {
- cout << id[*i] << " ";
- for (boost::tie(ei,edge_end) = out_edges(*i, g); ei != edge_end; ++ei)
- cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " ";
- cout << endl;
- }
- print_edges(g, id);
+ for (boost::tie(vi, viend) = vertices(g); vi != viend; ++vi)
+ id[*vi] = vnum++;
- cout << endl << "removing edge (1,3): " << endl;
- remove_edge(vertex(1, g), vertex(3, g), g);
+ add_edge(vertex(0, g), vertex(1, g), EdgeProperties("joe"), g);
+ add_edge(vertex(1, g), vertex(2, g), EdgeProperties("curly"), g);
+ add_edge(vertex(1, g), vertex(3, g), EdgeProperties("dick"), g);
+ add_edge(vertex(2, g), vertex(4, g), EdgeProperties("tom"), g);
+ add_edge(vertex(3, g), vertex(4, g), EdgeProperties("harry"), g);
- ei = out_edges(vertex(1, g), g).first;
- cout << "removing edge (" << id[source(*ei, g)]
- << "," << id[target(*ei, g)] << ")" << endl;
- remove_edge(ei, g);
+ graph_traits< Graph >::vertex_iterator i, end;
+ graph_traits< Graph >::out_edge_iterator ei, edge_end;
+ for (boost::tie(i, end) = vertices(g); i != end; ++i)
+ {
+ cout << id[*i] << " ";
+ for (boost::tie(ei, edge_end) = out_edges(*i, g); ei != edge_end; ++ei)
+ cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " ";
+ cout << endl;
+ }
+ print_edges(g, id);
- for(boost::tie(i,end) = vertices(g); i != end; ++i) {
- cout << id[*i] << " ";
- for (boost::tie(ei,edge_end) = out_edges(*i, g); ei != edge_end; ++ei)
- cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " ";
- cout << endl;
- }
+ cout << endl << "removing edge (1,3): " << endl;
+ remove_edge(vertex(1, g), vertex(3, g), g);
- print_edges(g, id);
+ ei = out_edges(vertex(1, g), g).first;
+ cout << "removing edge (" << id[source(*ei, g)] << "," << id[target(*ei, g)]
+ << ")" << endl;
+ remove_edge(ei, g);
- return 0;
+ for (boost::tie(i, end) = vertices(g); i != end; ++i)
+ {
+ cout << id[*i] << " ";
+ for (boost::tie(ei, edge_end) = out_edges(*i, g); ei != edge_end; ++ei)
+ cout << " --" << name[*ei] << "--> " << id[target(*ei, g)] << " ";
+ cout << endl;
+ }
+
+ print_edges(g, id);
+
+ return 0;
}
diff --git a/example/adjacency_list.expected b/example/adjacency_list.expected
index f85d7549..8fbdaeaa 100644
--- a/example/adjacency_list.expected
+++ b/example/adjacency_list.expected
@@ -1,15 +1,15 @@
-0 --joe--> 1
-1 --joe--> 0 --curly--> 2 --dick--> 3
-2 --curly--> 1 --tom--> 4
-3 --dick--> 1 --harry--> 4
-4 --tom--> 2 --harry--> 3
-(0,1) (1,2) (1,3) (2,4) (3,4)
+0 --joe--> 1
+1 --joe--> 0 --curly--> 2 --dick--> 3
+2 --curly--> 1 --tom--> 4
+3 --dick--> 1 --harry--> 4
+4 --tom--> 2 --harry--> 3
+(0,1) (1,2) (1,3) (2,4) (3,4)
-removing edge (1,3):
+removing edge (1,3):
removing edge (1,0)
-0
-1 --curly--> 2
-2 --curly--> 1 --tom--> 4
-3 --harry--> 4
-4 --tom--> 2 --harry--> 3
-(1,2) (2,4) (3,4)
+0
+1 --curly--> 2
+2 --curly--> 1 --tom--> 4
+3 --harry--> 4
+4 --tom--> 2 --harry--> 3
+(1,2) (2,4) (3,4)
diff --git a/example/adjacency_list_io.cpp b/example/adjacency_list_io.cpp
index ab626f89..bfc0280c 100644
--- a/example/adjacency_list_io.cpp
+++ b/example/adjacency_list_io.cpp
@@ -15,83 +15,99 @@
using namespace boost;
//======== my data structure
-struct MyStruct { double value; };
-std::ostream& operator << ( std::ostream& out, const MyStruct& s )
+struct MyStruct
{
- out << s.value << " ";
- return out;
+ double value;
+};
+std::ostream& operator<<(std::ostream& out, const MyStruct& s)
+{
+ out << s.value << " ";
+ return out;
}
-std::istream& operator >> ( std::istream& in, MyStruct& s )
+std::istream& operator>>(std::istream& in, MyStruct& s)
{
- in >> s.value;
- return in;
+ in >> s.value;
+ return in;
}
//======== vertex properties
-struct n1_t { enum { num = 23063}; typedef vertex_property_tag kind; };
-struct n2_t { enum { num = 23062}; typedef vertex_property_tag kind; };
-struct n3_t { enum { num = 23061}; typedef vertex_property_tag kind; };
+struct n1_t
+{
+ enum
+ {
+ num = 23063
+ };
+ typedef vertex_property_tag kind;
+};
+struct n2_t
+{
+ enum
+ {
+ num = 23062
+ };
+ typedef vertex_property_tag kind;
+};
+struct n3_t
+{
+ enum
+ {
+ num = 23061
+ };
+ typedef vertex_property_tag kind;
+};
typedef property< n1_t, int,
- property< n2_t, double,
- property< n3_t, MyStruct > > > VertexProperty;
-
+ property< n2_t, double, property< n3_t, MyStruct > > >
+ VertexProperty;
//====== edge properties
-struct e1_t { enum { num = 23064}; typedef edge_property_tag kind; };
-typedef property EdgeProperty;
-
-
+struct e1_t
+{
+ enum
+ {
+ num = 23064
+ };
+ typedef edge_property_tag kind;
+};
+typedef property< e1_t, double > EdgeProperty;
//===== graph types
-typedef
- adjacency_list
- Graph1;
+typedef adjacency_list< vecS, listS, directedS, no_property, no_property >
+ Graph1;
-typedef
- adjacency_list
- Graph2;
+typedef adjacency_list< setS, setS, bidirectionalS, VertexProperty,
+ EdgeProperty >
+ Graph2;
-
-
-int
-main()
+int main()
{
- // read Graph1
- Graph1 g1;
- std::ifstream readFile1("data1.txt");
- readFile1 >> read( g1 );
- std::cout << "graph g1 from file data1.txt:\n"
- << write( g1 )
- << std::endl;
+ // read Graph1
+ Graph1 g1;
+ std::ifstream readFile1("data1.txt");
+ readFile1 >> read(g1);
+ std::cout << "graph g1 from file data1.txt:\n" << write(g1) << std::endl;
- // read Graph2 and all internal properties
- Graph2 g2;
- std::ifstream readFile2("data2.txt");
- readFile2 >> read( g2 );
- std::cout << "graph g2 from file data2.txt:\n"
- << write( g2 )
- << std::endl;
-
- // read Graph2, no property given. Write no property.
- Graph2 g21;
- std::ifstream readFile21("data1.txt");
- readFile21 >> read( g21, no_property(), no_property() );
- std::cout << "graph g21 from file data1.txt:\n"
- << write(g21, no_property(), no_property())
- << std::endl;
-
- // read Graph2, incomplete data in a different order. Write it diffently.
- Graph2 g31;
- std::ifstream readFile31("data3.txt");
- typedef property< n3_t, MyStruct, property< n1_t, int > > readNodeProp;
- readFile31 >> read( g31, readNodeProp() , EdgeProperty() );
- std::cout << "graph g31 from file data3.txt:\n"
- << write( g31, property(), EdgeProperty() )
- << std::endl;
-
+ // read Graph2 and all internal properties
+ Graph2 g2;
+ std::ifstream readFile2("data2.txt");
+ readFile2 >> read(g2);
+ std::cout << "graph g2 from file data2.txt:\n" << write(g2) << std::endl;
- return 0;
+ // read Graph2, no property given. Write no property.
+ Graph2 g21;
+ std::ifstream readFile21("data1.txt");
+ readFile21 >> read(g21, no_property(), no_property());
+ std::cout << "graph g21 from file data1.txt:\n"
+ << write(g21, no_property(), no_property()) << std::endl;
+
+ // read Graph2, incomplete data in a different order. Write it diffently.
+ Graph2 g31;
+ std::ifstream readFile31("data3.txt");
+ typedef property< n3_t, MyStruct, property< n1_t, int > > readNodeProp;
+ readFile31 >> read(g31, readNodeProp(), EdgeProperty());
+ std::cout << "graph g31 from file data3.txt:\n"
+ << write(g31, property< n3_t, MyStruct >(), EdgeProperty())
+ << std::endl;
+
+ return 0;
}
-
-
diff --git a/example/adjacency_matrix.cpp b/example/adjacency_matrix.cpp
index accbfca1..4f36ead9 100644
--- a/example/adjacency_matrix.cpp
+++ b/example/adjacency_matrix.cpp
@@ -11,57 +11,65 @@
#include
#include
-
int main()
{
- using namespace boost;
- enum { A, B, C, D, E, F, N };
- const char* name = "ABCDEF";
+ using namespace boost;
+ enum
+ {
+ A,
+ B,
+ C,
+ D,
+ E,
+ F,
+ N
+ };
+ const char* name = "ABCDEF";
- // A directed graph
-
- typedef adjacency_matrix Graph;
- Graph g(N);
- add_edge(B, C, g);
- add_edge(B, F, g);
- add_edge(C, A, g);
- add_edge(C, C, g);
- add_edge(D, E, g);
- add_edge(E, D, g);
- add_edge(F, A, g);
+ // A directed graph
- std::cout << "vertex set: ";
- print_vertices(g, name);
- std::cout << std::endl;
+ typedef adjacency_matrix< directedS > Graph;
+ Graph g(N);
+ add_edge(B, C, g);
+ add_edge(B, F, g);
+ add_edge(C, A, g);
+ add_edge(C, C, g);
+ add_edge(D, E, g);
+ add_edge(E, D, g);
+ add_edge(F, A, g);
- std::cout << "edge set: ";
- print_edges(g, name);
- std::cout << std::endl;
+ std::cout << "vertex set: ";
+ print_vertices(g, name);
+ std::cout << std::endl;
- std::cout << "out-edges: " << std::endl;
- print_graph(g, name);
- std::cout << std::endl;
+ std::cout << "edge set: ";
+ print_edges(g, name);
+ std::cout << std::endl;
- // An undirected graph
+ std::cout << "out-edges: " << std::endl;
+ print_graph(g, name);
+ std::cout << std::endl;
- typedef adjacency_matrix UGraph;
- UGraph ug(N);
- add_edge(B, C, ug);
- add_edge(B, F, ug);
- add_edge(C, A, ug);
- add_edge(D, E, ug);
- add_edge(F, A, ug);
+ // An undirected graph
- std::cout << "vertex set: ";
- print_vertices(ug, name);
- std::cout << std::endl;
+ typedef adjacency_matrix< undirectedS > UGraph;
+ UGraph ug(N);
+ add_edge(B, C, ug);
+ add_edge(B, F, ug);
+ add_edge(C, A, ug);
+ add_edge(D, E, ug);
+ add_edge(F, A, ug);
- std::cout << "edge set: ";
- print_edges(ug, name);
- std::cout << std::endl;
+ std::cout << "vertex set: ";
+ print_vertices(ug, name);
+ std::cout << std::endl;
- std::cout << "incident edges: " << std::endl;
- print_graph(ug, name);
- std::cout << std::endl;
- return 0;
+ std::cout << "edge set: ";
+ print_edges(ug, name);
+ std::cout << std::endl;
+
+ std::cout << "incident edges: " << std::endl;
+ print_graph(ug, name);
+ std::cout << std::endl;
+ return 0;
}
diff --git a/example/astar-cities.cpp b/example/astar-cities.cpp
index bca64466..3437e6ab 100644
--- a/example/astar-cities.cpp
+++ b/example/astar-cities.cpp
@@ -10,7 +10,6 @@
//=======================================================================
//
-
#include
#include
#include
@@ -21,204 +20,218 @@
#include
#include
#include
-#include // for sqrt
+#include // for sqrt
using namespace boost;
using namespace std;
-
// auxiliary types
struct location
{
- float y, x; // lat, long
+ float y, x; // lat, long
};
typedef float cost;
-template
-class city_writer {
-public:
- city_writer(Name n, LocMap l, float _minx, float _maxx,
- float _miny, float _maxy,
- unsigned int _ptx, unsigned int _pty)
- : name(n), loc(l), minx(_minx), maxx(_maxx), miny(_miny),
- maxy(_maxy), ptx(_ptx), pty(_pty) {}
- template
- void operator()(ostream& out, const Vertex& v) const {
- float px = 1 - (loc[v].x - minx) / (maxx - minx);
- float py = (loc[v].y - miny) / (maxy - miny);
- out << "[label=\"" << name[v] << "\", pos=\""
- << static_cast(ptx * px) << ","
- << static_cast(pty * py)
- << "\", fontsize=\"11\"]";
- }
-private:
- Name name;
- LocMap loc;
- float minx, maxx, miny, maxy;
- unsigned int ptx, pty;
-};
-
-template
-class time_writer {
-public:
- time_writer(WeightMap w) : wm(w) {}
- template
- void operator()(ostream &out, const Edge& e) const {
- out << "[label=\"" << wm[e] << "\", fontsize=\"11\"]";
- }
-private:
- WeightMap wm;
-};
-
-
-// euclidean distance heuristic
-template
-class distance_heuristic : public astar_heuristic
+template < class Name, class LocMap > class city_writer
{
public:
- typedef typename graph_traits::vertex_descriptor Vertex;
- distance_heuristic(LocMap l, Vertex goal)
- : m_location(l), m_goal(goal) {}
- CostType operator()(Vertex u)
- {
- CostType dx = m_location[m_goal].x - m_location[u].x;
- CostType dy = m_location[m_goal].y - m_location[u].y;
- return ::sqrt(dx * dx + dy * dy);
- }
+ city_writer(Name n, LocMap l, float _minx, float _maxx, float _miny,
+ float _maxy, unsigned int _ptx, unsigned int _pty)
+ : name(n)
+ , loc(l)
+ , minx(_minx)
+ , maxx(_maxx)
+ , miny(_miny)
+ , maxy(_maxy)
+ , ptx(_ptx)
+ , pty(_pty)
+ {
+ }
+ template < class Vertex >
+ void operator()(ostream& out, const Vertex& v) const
+ {
+ float px = 1 - (loc[v].x - minx) / (maxx - minx);
+ float py = (loc[v].y - miny) / (maxy - miny);
+ out << "[label=\"" << name[v] << "\", pos=\""
+ << static_cast< unsigned int >(ptx * px) << ","
+ << static_cast< unsigned int >(pty * py) << "\", fontsize=\"11\"]";
+ }
+
private:
- LocMap m_location;
- Vertex m_goal;
+ Name name;
+ LocMap loc;
+ float minx, maxx, miny, maxy;
+ unsigned int ptx, pty;
};
+template < class WeightMap > class time_writer
+{
+public:
+ time_writer(WeightMap w) : wm(w) {}
+ template < class Edge > void operator()(ostream& out, const Edge& e) const
+ {
+ out << "[label=\"" << wm[e] << "\", fontsize=\"11\"]";
+ }
-struct found_goal {}; // exception for termination
+private:
+ WeightMap wm;
+};
+
+// euclidean distance heuristic
+template < class Graph, class CostType, class LocMap >
+class distance_heuristic : public astar_heuristic< Graph, CostType >
+{
+public:
+ typedef typename graph_traits< Graph >::vertex_descriptor Vertex;
+ distance_heuristic(LocMap l, Vertex goal) : m_location(l), m_goal(goal) {}
+ CostType operator()(Vertex u)
+ {
+ CostType dx = m_location[m_goal].x - m_location[u].x;
+ CostType dy = m_location[m_goal].y - m_location[u].y;
+ return ::sqrt(dx * dx + dy * dy);
+ }
+
+private:
+ LocMap m_location;
+ Vertex m_goal;
+};
+
+struct found_goal
+{
+}; // exception for termination
// visitor that terminates when we find the goal
-template
+template < class Vertex >
class astar_goal_visitor : public boost::default_astar_visitor
{
public:
- astar_goal_visitor(Vertex goal) : m_goal(goal) {}
- template
- void examine_vertex(Vertex u, Graph& g) {
- if(u == m_goal)
- throw found_goal();
- }
+ astar_goal_visitor(Vertex goal) : m_goal(goal) {}
+ template < class Graph > void examine_vertex(Vertex u, Graph& g)
+ {
+ if (u == m_goal)
+ throw found_goal();
+ }
+
private:
- Vertex m_goal;
+ Vertex m_goal;
};
-
-int main(int argc, char **argv)
+int main(int argc, char** argv)
{
-
- // specify some types
- typedef adjacency_list > mygraph_t;
- typedef property_map::type WeightMap;
- typedef mygraph_t::vertex_descriptor vertex;
- typedef mygraph_t::edge_descriptor edge_descriptor;
- typedef std::pair edge;
-
- // specify data
- enum nodes {
- Troy, LakePlacid, Plattsburgh, Massena, Watertown, Utica,
- Syracuse, Rochester, Buffalo, Ithaca, Binghamton, Woodstock,
- NewYork, N
- };
- const char *name[] = {
- "Troy", "Lake Placid", "Plattsburgh", "Massena",
- "Watertown", "Utica", "Syracuse", "Rochester", "Buffalo",
- "Ithaca", "Binghamton", "Woodstock", "New York"
- };
- location locations[] = { // lat/long
- {42.73, 73.68}, {44.28, 73.99}, {44.70, 73.46},
- {44.93, 74.89}, {43.97, 75.91}, {43.10, 75.23},
- {43.04, 76.14}, {43.17, 77.61}, {42.89, 78.86},
- {42.44, 76.50}, {42.10, 75.91}, {42.04, 74.11},
- {40.67, 73.94}
- };
- edge edge_array[] = {
- edge(Troy,Utica), edge(Troy,LakePlacid),
- edge(Troy,Plattsburgh), edge(LakePlacid,Plattsburgh),
- edge(Plattsburgh,Massena), edge(LakePlacid,Massena),
- edge(Massena,Watertown), edge(Watertown,Utica),
- edge(Watertown,Syracuse), edge(Utica,Syracuse),
- edge(Syracuse,Rochester), edge(Rochester,Buffalo),
- edge(Syracuse,Ithaca), edge(Ithaca,Binghamton),
- edge(Ithaca,Rochester), edge(Binghamton,Troy),
- edge(Binghamton,Woodstock), edge(Binghamton,NewYork),
- edge(Syracuse,Binghamton), edge(Woodstock,Troy),
- edge(Woodstock,NewYork)
- };
- unsigned int num_edges = sizeof(edge_array) / sizeof(edge);
- cost weights[] = { // estimated travel time (mins)
- 96, 134, 143, 65, 115, 133, 117, 116, 74, 56,
- 84, 73, 69, 70, 116, 147, 173, 183, 74, 71, 124
- };
-
-
- // create graph
- mygraph_t g(N);
- WeightMap weightmap = get(edge_weight, g);
- for(std::size_t j = 0; j < num_edges; ++j) {
- edge_descriptor e; bool inserted;
- boost::tie(e, inserted) = add_edge(edge_array[j].first,
- edge_array[j].second, g);
- weightmap[e] = weights[j];
- }
-
-
- // pick random start/goal
- boost::mt19937 gen(std::time(0));
- vertex start = random_vertex(g, gen);
- vertex goal = random_vertex(g, gen);
-
-
- cout << "Start vertex: " << name[start] << endl;
- cout << "Goal vertex: " << name[goal] << endl;
-
- ofstream dotfile;
- dotfile.open("test-astar-cities.dot");
- write_graphviz(dotfile, g,
- city_writer
- (name, locations, 73.46, 78.86, 40.67, 44.93,
- 480, 400),
- time_writer(weightmap));
-
-
- vector p(num_vertices(g));
- vector d(num_vertices(g));
- try {
- // call astar named parameter interface
- astar_search_tree
- (g, start,
- distance_heuristic
- (locations, goal),
- predecessor_map(make_iterator_property_map(p.begin(), get(vertex_index, g))).
- distance_map(make_iterator_property_map(d.begin(), get(vertex_index, g))).
- visitor(astar_goal_visitor(goal)));
-
-
- } catch(found_goal fg) { // found a path to the goal
- list shortest_path;
- for(vertex v = goal;; v = p[v]) {
- shortest_path.push_front(v);
- if(p[v] == v)
- break;
+
+ // specify some types
+ typedef adjacency_list< listS, vecS, undirectedS, no_property,
+ property< edge_weight_t, cost > >
+ mygraph_t;
+ typedef property_map< mygraph_t, edge_weight_t >::type WeightMap;
+ typedef mygraph_t::vertex_descriptor vertex;
+ typedef mygraph_t::edge_descriptor edge_descriptor;
+ typedef std::pair< int, int > edge;
+
+ // specify data
+ enum nodes
+ {
+ Troy,
+ LakePlacid,
+ Plattsburgh,
+ Massena,
+ Watertown,
+ Utica,
+ Syracuse,
+ Rochester,
+ Buffalo,
+ Ithaca,
+ Binghamton,
+ Woodstock,
+ NewYork,
+ N
+ };
+ const char* name[] = { "Troy", "Lake Placid", "Plattsburgh", "Massena",
+ "Watertown", "Utica", "Syracuse", "Rochester", "Buffalo", "Ithaca",
+ "Binghamton", "Woodstock", "New York" };
+ location locations[] = { // lat/long
+ { 42.73, 73.68 }, { 44.28, 73.99 }, { 44.70, 73.46 }, { 44.93, 74.89 },
+ { 43.97, 75.91 }, { 43.10, 75.23 }, { 43.04, 76.14 }, { 43.17, 77.61 },
+ { 42.89, 78.86 }, { 42.44, 76.50 }, { 42.10, 75.91 }, { 42.04, 74.11 },
+ { 40.67, 73.94 }
+ };
+ edge edge_array[]
+ = { edge(Troy, Utica), edge(Troy, LakePlacid), edge(Troy, Plattsburgh),
+ edge(LakePlacid, Plattsburgh), edge(Plattsburgh, Massena),
+ edge(LakePlacid, Massena), edge(Massena, Watertown),
+ edge(Watertown, Utica), edge(Watertown, Syracuse),
+ edge(Utica, Syracuse), edge(Syracuse, Rochester),
+ edge(Rochester, Buffalo), edge(Syracuse, Ithaca),
+ edge(Ithaca, Binghamton), edge(Ithaca, Rochester),
+ edge(Binghamton, Troy), edge(Binghamton, Woodstock),
+ edge(Binghamton, NewYork), edge(Syracuse, Binghamton),
+ edge(Woodstock, Troy), edge(Woodstock, NewYork) };
+ unsigned int num_edges = sizeof(edge_array) / sizeof(edge);
+ cost weights[] = { // estimated travel time (mins)
+ 96, 134, 143, 65, 115, 133, 117, 116, 74, 56, 84, 73, 69, 70, 116, 147,
+ 173, 183, 74, 71, 124
+ };
+
+ // create graph
+ mygraph_t g(N);
+ WeightMap weightmap = get(edge_weight, g);
+ for (std::size_t j = 0; j < num_edges; ++j)
+ {
+ edge_descriptor e;
+ bool inserted;
+ boost::tie(e, inserted)
+ = add_edge(edge_array[j].first, edge_array[j].second, g);
+ weightmap[e] = weights[j];
}
- cout << "Shortest path from " << name[start] << " to "
- << name[goal] << ": ";
- list::iterator spi = shortest_path.begin();
- cout << name[start];
- for(++spi; spi != shortest_path.end(); ++spi)
- cout << " -> " << name[*spi];
- cout << endl << "Total travel time: " << d[goal] << endl;
+
+ // pick random start/goal
+ boost::mt19937 gen(std::time(0));
+ vertex start = random_vertex(g, gen);
+ vertex goal = random_vertex(g, gen);
+
+ cout << "Start vertex: " << name[start] << endl;
+ cout << "Goal vertex: " << name[goal] << endl;
+
+ ofstream dotfile;
+ dotfile.open("test-astar-cities.dot");
+ write_graphviz(dotfile, g,
+ city_writer< const char**, location* >(
+ name, locations, 73.46, 78.86, 40.67, 44.93, 480, 400),
+ time_writer< WeightMap >(weightmap));
+
+ vector< mygraph_t::vertex_descriptor > p(num_vertices(g));
+ vector< cost > d(num_vertices(g));
+ try
+ {
+ // call astar named parameter interface
+ astar_search_tree(g, start,
+ distance_heuristic< mygraph_t, cost, location* >(locations, goal),
+ predecessor_map(
+ make_iterator_property_map(p.begin(), get(vertex_index, g)))
+ .distance_map(
+ make_iterator_property_map(d.begin(), get(vertex_index, g)))
+ .visitor(astar_goal_visitor< vertex >(goal)));
+ }
+ catch (found_goal fg)
+ { // found a path to the goal
+ list< vertex > shortest_path;
+ for (vertex v = goal;; v = p[v])
+ {
+ shortest_path.push_front(v);
+ if (p[v] == v)
+ break;
+ }
+ cout << "Shortest path from " << name[start] << " to " << name[goal]
+ << ": ";
+ list< vertex >::iterator spi = shortest_path.begin();
+ cout << name[start];
+ for (++spi; spi != shortest_path.end(); ++spi)
+ cout << " -> " << name[*spi];
+ cout << endl << "Total travel time: " << d[goal] << endl;
+ return 0;
+ }
+
+ cout << "Didn't find a path from " << name[start] << "to" << name[goal]
+ << "!" << endl;
return 0;
- }
-
- cout << "Didn't find a path from " << name[start] << "to"
- << name[goal] << "!" << endl;
- return 0;
-
}
diff --git a/example/astar_maze.cpp b/example/astar_maze.cpp
index e567a15b..4c437ee8 100644
--- a/example/astar_maze.cpp
+++ b/example/astar_maze.cpp
@@ -4,7 +4,6 @@
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
-
// This program uses the A-star search algorithm in the Boost Graph Library to
// solve a maze. It is an example of how to apply Boost Graph Library
// algorithms to implicit graphs.
@@ -26,11 +25,11 @@
IMPORTANT:
~~~~~~~~~~
- This example appears to be broken and crashes at runtime, see https://github.com/boostorg/graph/issues/148
+ This example appears to be broken and crashes at runtime, see
+ https://github.com/boostorg/graph/issues/148
*/
-
#include
#include
#include
@@ -49,25 +48,27 @@ boost::mt19937 random_generator;
typedef double distance;
#define GRID_RANK 2
-typedef boost::grid_graph grid;
-typedef boost::graph_traits::vertex_descriptor vertex_descriptor;
-typedef boost::graph_traits::vertices_size_type vertices_size_type;
+typedef boost::grid_graph< GRID_RANK > grid;
+typedef boost::graph_traits< grid >::vertex_descriptor vertex_descriptor;
+typedef boost::graph_traits< grid >::vertices_size_type vertices_size_type;
// A hash function for vertices.
-struct vertex_hash {
- typedef vertex_descriptor argument_type;
- typedef std::size_t result_type;
- std::size_t operator()(vertex_descriptor const& u) const {
- std::size_t seed = 0;
- boost::hash_combine(seed, u[0]);
- boost::hash_combine(seed, u[1]);
- return seed;
- }
+struct vertex_hash
+{
+ typedef vertex_descriptor argument_type;
+ typedef std::size_t result_type;
+ std::size_t operator()(vertex_descriptor const& u) const
+ {
+ std::size_t seed = 0;
+ boost::hash_combine(seed, u[0]);
+ boost::hash_combine(seed, u[1]);
+ return seed;
+ }
};
-typedef boost::unordered_set vertex_set;
-typedef boost::vertex_subset_complement_filter::type
- filtered_grid;
+typedef boost::unordered_set< vertex_descriptor, vertex_hash > vertex_set;
+typedef boost::vertex_subset_complement_filter< grid, vertex_set >::type
+ filtered_grid;
// A searchable maze
//
@@ -84,235 +85,260 @@ typedef boost::vertex_subset_complement_filter::type
// A-star search is used to find a path through the maze. Each edge has a
// weight of one, so the total path length is equal to the number of edges
// traversed.
-class maze {
+class maze
+{
public:
- friend std::ostream& operator<<(std::ostream&, const maze&);
- friend void random_maze(maze&);
+ friend std::ostream& operator<<(std::ostream&, const maze&);
+ friend void random_maze(maze&);
- maze():m_grid(create_grid(0, 0)),m_barrier_grid(create_barrier_grid()) {};
- maze(std::size_t x, std::size_t y):m_grid(create_grid(x, y)),
- m_barrier_grid(create_barrier_grid()) {};
+ maze()
+ : m_grid(create_grid(0, 0)), m_barrier_grid(create_barrier_grid()) {};
+ maze(std::size_t x, std::size_t y)
+ : m_grid(create_grid(x, y)), m_barrier_grid(create_barrier_grid()) {};
- // The length of the maze along the specified dimension.
- vertices_size_type length(std::size_t d) const {return m_grid.length(d);}
+ // The length of the maze along the specified dimension.
+ vertices_size_type length(std::size_t d) const { return m_grid.length(d); }
- bool has_barrier(vertex_descriptor u) const {
- return m_barriers.find(u) != m_barriers.end();
- }
+ bool has_barrier(vertex_descriptor u) const
+ {
+ return m_barriers.find(u) != m_barriers.end();
+ }
- // Try to find a path from the lower-left-hand corner source (0,0) to the
- // upper-right-hand corner goal (x-1, y-1).
- vertex_descriptor source() const {return vertex(0, m_grid);}
- vertex_descriptor goal() const {
- return vertex(num_vertices(m_grid)-1, m_grid);
- }
+ // Try to find a path from the lower-left-hand corner source (0,0) to the
+ // upper-right-hand corner goal (x-1, y-1).
+ vertex_descriptor source() const { return vertex(0, m_grid); }
+ vertex_descriptor goal() const
+ {
+ return vertex(num_vertices(m_grid) - 1, m_grid);
+ }
- bool solve();
- bool solved() const {return !m_solution.empty();}
- bool solution_contains(vertex_descriptor u) const {
- return m_solution.find(u) != m_solution.end();
- }
+ bool solve();
+ bool solved() const { return !m_solution.empty(); }
+ bool solution_contains(vertex_descriptor u) const
+ {
+ return m_solution.find(u) != m_solution.end();
+ }
private:
- // Create the underlying rank-2 grid with the specified dimensions.
- grid create_grid(std::size_t x, std::size_t y) {
- boost::array lengths = { {x, y} };
- return grid(lengths);
- }
+ // Create the underlying rank-2 grid with the specified dimensions.
+ grid create_grid(std::size_t x, std::size_t y)
+ {
+ boost::array< std::size_t, GRID_RANK > lengths = { { x, y } };
+ return grid(lengths);
+ }
- // Filter the barrier vertices out of the underlying grid.
- filtered_grid create_barrier_grid() {
- return boost::make_vertex_subset_complement_filter(m_grid, m_barriers);
- }
+ // Filter the barrier vertices out of the underlying grid.
+ filtered_grid create_barrier_grid()
+ {
+ return boost::make_vertex_subset_complement_filter(m_grid, m_barriers);
+ }
- // The grid underlying the maze
- grid m_grid;
- // The barriers in the maze
- vertex_set m_barriers;
- // The underlying maze grid with barrier vertices filtered out
- filtered_grid m_barrier_grid;
- // The vertices on a solution path through the maze
- vertex_set m_solution;
- // The length of the solution path
- distance m_solution_length;
+ // The grid underlying the maze
+ grid m_grid;
+ // The barriers in the maze
+ vertex_set m_barriers;
+ // The underlying maze grid with barrier vertices filtered out
+ filtered_grid m_barrier_grid;
+ // The vertices on a solution path through the maze
+ vertex_set m_solution;
+ // The length of the solution path
+ distance m_solution_length;
};
-
// Euclidean heuristic for a grid
//
// This calculates the Euclidean distance between a vertex and a goal
// vertex.
-class euclidean_heuristic:
- public boost::astar_heuristic
+class euclidean_heuristic
+: public boost::astar_heuristic< filtered_grid, double >
{
public:
- euclidean_heuristic(vertex_descriptor goal):m_goal(goal) {};
+ euclidean_heuristic(vertex_descriptor goal) : m_goal(goal) {};
- double operator()(vertex_descriptor v) {
- return sqrt(pow(double(m_goal[0] - v[0]), 2) + pow(double(m_goal[1] - v[1]), 2));
- }
+ double operator()(vertex_descriptor v)
+ {
+ return sqrt(pow(double(m_goal[0] - v[0]), 2)
+ + pow(double(m_goal[1] - v[1]), 2));
+ }
private:
- vertex_descriptor m_goal;
+ vertex_descriptor m_goal;
};
// Exception thrown when the goal vertex is found
-struct found_goal {};
+struct found_goal
+{
+};
// Visitor that terminates when we find the goal vertex
-struct astar_goal_visitor:public boost::default_astar_visitor {
- astar_goal_visitor(vertex_descriptor goal):m_goal(goal) {};
+struct astar_goal_visitor : public boost::default_astar_visitor
+{
+ astar_goal_visitor(vertex_descriptor goal) : m_goal(goal) {};
- void examine_vertex(vertex_descriptor u, const filtered_grid&) {
- if (u == m_goal)
- throw found_goal();
- }
+ void examine_vertex(vertex_descriptor u, const filtered_grid&)
+ {
+ if (u == m_goal)
+ throw found_goal();
+ }
private:
- vertex_descriptor m_goal;
+ vertex_descriptor m_goal;
};
// Solve the maze using A-star search. Return true if a solution was found.
-bool maze::solve() {
- boost::static_property_map weight(1);
- // The predecessor map is a vertex-to-vertex mapping.
- typedef boost::unordered_map pred_map;
- pred_map predecessor;
- boost::associative_property_map pred_pmap(predecessor);
- // The distance map is a vertex-to-distance mapping.
- typedef boost::unordered_map dist_map;
- dist_map distance;
- boost::associative_property_map dist_pmap(distance);
+bool maze::solve()
+{
+ boost::static_property_map< distance > weight(1);
+ // The predecessor map is a vertex-to-vertex mapping.
+ typedef boost::unordered_map< vertex_descriptor, vertex_descriptor,
+ vertex_hash >
+ pred_map;
+ pred_map predecessor;
+ boost::associative_property_map< pred_map > pred_pmap(predecessor);
+ // The distance map is a vertex-to-distance mapping.
+ typedef boost::unordered_map< vertex_descriptor, distance, vertex_hash >
+ dist_map;
+ dist_map distance;
+ boost::associative_property_map< dist_map > dist_pmap(distance);
- vertex_descriptor s = source();
- vertex_descriptor g = goal();
- euclidean_heuristic heuristic(g);
- astar_goal_visitor visitor(g);
+ vertex_descriptor s = source();
+ vertex_descriptor g = goal();
+ euclidean_heuristic heuristic(g);
+ astar_goal_visitor visitor(g);
- try {
- astar_search(m_barrier_grid, s, heuristic,
- boost::weight_map(weight).
- predecessor_map(pred_pmap).
- distance_map(dist_pmap).
- visitor(visitor) );
- } catch(found_goal fg) {
- // Walk backwards from the goal through the predecessor chain adding
- // vertices to the solution path.
- for (vertex_descriptor u = g; u != s; u = predecessor[u])
- m_solution.insert(u);
- m_solution.insert(s);
- m_solution_length = distance[g];
- return true;
- }
+ try
+ {
+ astar_search(m_barrier_grid, s, heuristic,
+ boost::weight_map(weight)
+ .predecessor_map(pred_pmap)
+ .distance_map(dist_pmap)
+ .visitor(visitor));
+ }
+ catch (found_goal fg)
+ {
+ // Walk backwards from the goal through the predecessor chain adding
+ // vertices to the solution path.
+ for (vertex_descriptor u = g; u != s; u = predecessor[u])
+ m_solution.insert(u);
+ m_solution.insert(s);
+ m_solution_length = distance[g];
+ return true;
+ }
- return false;
+ return false;
}
-
#define BARRIER "#"
// Print the maze as an ASCII map.
-std::ostream& operator<<(std::ostream& output, const maze& m) {
- // Header
- for (vertices_size_type i = 0; i < m.length(0)+2; i++)
- output << BARRIER;
- output << std::endl;
- // Body
- for (int y = m.length(1)-1; y >= 0; y--) {
- // Enumerate rows in reverse order and columns in regular order so that
- // (0,0) appears in the lower left-hand corner. This requires that y be
- // int and not the unsigned vertices_size_type because the loop exit
- // condition is y==-1.
- for (vertices_size_type x = 0; x < m.length(0); x++) {
- // Put a barrier on the left-hand side.
- if (x == 0)
+std::ostream& operator<<(std::ostream& output, const maze& m)
+{
+ // Header
+ for (vertices_size_type i = 0; i < m.length(0) + 2; i++)
output << BARRIER;
- // Put the character representing this point in the maze grid.
- vertex_descriptor u = {{x, vertices_size_type(y)}};
- if (m.solution_contains(u))
- output << ".";
- else if (m.has_barrier(u))
- output << BARRIER;
- else
- output << " ";
- // Put a barrier on the right-hand side.
- if (x == m.length(0)-1)
- output << BARRIER;
- }
- // Put a newline after every row except the last one.
output << std::endl;
- }
- // Footer
- for (vertices_size_type i = 0; i < m.length(0)+2; i++)
- output << BARRIER;
- if (m.solved())
- output << std::endl << "Solution length " << m.m_solution_length;
- return output;
+ // Body
+ for (int y = m.length(1) - 1; y >= 0; y--)
+ {
+ // Enumerate rows in reverse order and columns in regular order so that
+ // (0,0) appears in the lower left-hand corner. This requires that y be
+ // int and not the unsigned vertices_size_type because the loop exit
+ // condition is y==-1.
+ for (vertices_size_type x = 0; x < m.length(0); x++)
+ {
+ // Put a barrier on the left-hand side.
+ if (x == 0)
+ output << BARRIER;
+ // Put the character representing this point in the maze grid.
+ vertex_descriptor u = { { x, vertices_size_type(y) } };
+ if (m.solution_contains(u))
+ output << ".";
+ else if (m.has_barrier(u))
+ output << BARRIER;
+ else
+ output << " ";
+ // Put a barrier on the right-hand side.
+ if (x == m.length(0) - 1)
+ output << BARRIER;
+ }
+ // Put a newline after every row except the last one.
+ output << std::endl;
+ }
+ // Footer
+ for (vertices_size_type i = 0; i < m.length(0) + 2; i++)
+ output << BARRIER;
+ if (m.solved())
+ output << std::endl << "Solution length " << m.m_solution_length;
+ return output;
}
// Return a random integer in the interval [a, b].
-std::size_t random_int(std::size_t a, std::size_t b) {
- if (b < a)
- b = a;
- boost::uniform_int<> dist(a, b);
- boost::variate_generator >
- generate(random_generator, dist);
- return generate();
+std::size_t random_int(std::size_t a, std::size_t b)
+{
+ if (b < a)
+ b = a;
+ boost::uniform_int<> dist(a, b);
+ boost::variate_generator< boost::mt19937&, boost::uniform_int<> > generate(
+ random_generator, dist);
+ return generate();
}
// Generate a maze with a random assignment of barriers.
-void random_maze(maze& m) {
- vertices_size_type n = num_vertices(m.m_grid);
- vertex_descriptor s = m.source();
- vertex_descriptor g = m.goal();
- // One quarter of the cells in the maze should be barriers.
- int barriers = n/4;
- while (barriers > 0) {
- // Choose horizontal or vertical direction.
- std::size_t direction = random_int(0, 1);
- // Walls range up to one quarter the dimension length in this direction.
- vertices_size_type wall = random_int(1, m.length(direction)/4);
- // Create the wall while decrementing the total barrier count.
- vertex_descriptor u = vertex(random_int(0, n-1), m.m_grid);
- while (wall) {
- // Start and goal spaces should never be barriers.
- if (u != s && u != g) {
- wall--;
- if (!m.has_barrier(u)) {
- m.m_barriers.insert(u);
- barriers--;
+void random_maze(maze& m)
+{
+ vertices_size_type n = num_vertices(m.m_grid);
+ vertex_descriptor s = m.source();
+ vertex_descriptor g = m.goal();
+ // One quarter of the cells in the maze should be barriers.
+ int barriers = n / 4;
+ while (barriers > 0)
+ {
+ // Choose horizontal or vertical direction.
+ std::size_t direction = random_int(0, 1);
+ // Walls range up to one quarter the dimension length in this direction.
+ vertices_size_type wall = random_int(1, m.length(direction) / 4);
+ // Create the wall while decrementing the total barrier count.
+ vertex_descriptor u = vertex(random_int(0, n - 1), m.m_grid);
+ while (wall)
+ {
+ // Start and goal spaces should never be barriers.
+ if (u != s && u != g)
+ {
+ wall--;
+ if (!m.has_barrier(u))
+ {
+ m.m_barriers.insert(u);
+ barriers--;
+ }
+ }
+ vertex_descriptor v = m.m_grid.next(u, direction);
+ // Stop creating this wall if we reached the maze's edge.
+ if (u == v)
+ break;
+ u = v;
}
- }
- vertex_descriptor v = m.m_grid.next(u, direction);
- // Stop creating this wall if we reached the maze's edge.
- if (u == v)
- break;
- u = v;
}
- }
}
-int main (int argc, char const *argv[]) {
- // The default maze size is 20x10. A different size may be specified on
- // the command line.
- std::size_t x = 20;
- std::size_t y = 10;
+int main(int argc, char const* argv[])
+{
+ // The default maze size is 20x10. A different size may be specified on
+ // the command line.
+ std::size_t x = 20;
+ std::size_t y = 10;
- if (argc == 3) {
- x = boost::lexical_cast(argv[1]);
- y = boost::lexical_cast(argv[2]);
- }
+ if (argc == 3)
+ {
+ x = boost::lexical_cast< std::size_t >(argv[1]);
+ y = boost::lexical_cast< std::size_t >(argv[2]);
+ }
- random_generator.seed(std::time(0));
- maze m(x, y);
- random_maze(m);
- if (m.solve())
- std::cout << "Solved the maze." << std::endl;
- else
- std::cout << "The maze is not solvable." << std::endl;
- std::cout << m << std::endl;
- return 0;
+ random_generator.seed(std::time(0));
+ maze m(x, y);
+ random_maze(m);
+ if (m.solve())
+ std::cout << "Solved the maze." << std::endl;
+ else
+ std::cout << "The maze is not solvable." << std::endl;
+ std::cout << m << std::endl;
+ return 0;
}
diff --git a/example/bcsstk01.rsa b/example/bcsstk01.rsa
index 3d420ed4..42848878 100644
--- a/example/bcsstk01.rsa
+++ b/example/bcsstk01.rsa
@@ -1,11 +1,11 @@
1SYMMETRIC STIFFNESS MATRIX SMALL GENERALIZED EIGENVALUE PROBLEM BCSSTK01
- 74 4 14 56 0
-RSA 48 48 224 0
-(16I5) (16I5) (4E20.12)
+ 74 4 14 56 0
+RSA 48 48 224 0
+(16I5) (16I5) (4E20.12)
1 9 17 25 31 37 43 49 55 62 66 70 75 85 95 104
112 120 127 132 136 141 144 146 149 154 158 161 164 167 169 173
178 183 185 188 191 196 201 205 208 211 213 216 219 221 222 224
- 225
+ 225
1 5 6 7 11 19 25 30 2 4 6 8 10 20 24 26
3 4 5 9 21 23 27 28 4 8 10 22 27 28 5 7
11 21 23 29 6 12 20 24 25 30 7 11 12 13 31 36
diff --git a/example/bellman-example.cpp b/example/bellman-example.cpp
index e6ec8750..69bce639 100644
--- a/example/bellman-example.cpp
+++ b/example/bellman-example.cpp
@@ -1,5 +1,5 @@
//=======================================================================
-// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
+// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
@@ -15,114 +15,120 @@
using namespace boost;
-template < typename Graph, typename ParentMap >
-struct edge_writer
+template < typename Graph, typename ParentMap > struct edge_writer
{
- edge_writer(const Graph & g, const ParentMap & p)
- : m_g(g), m_parent(p)
- {
- }
+ edge_writer(const Graph& g, const ParentMap& p) : m_g(g), m_parent(p) {}
- template < typename Edge >
- void operator() (std::ostream & out, const Edge & e) const
- {
- out << "[label=\"" << get(edge_weight, m_g, e) << "\"";
- typename graph_traits < Graph >::vertex_descriptor
- u = source(e, m_g), v = target(e, m_g);
- if (m_parent[v] == u)
- out << ", color=\"black\"";
- else
- out << ", color=\"grey\"";
- out << "]";
- }
- const Graph & m_g;
- ParentMap m_parent;
+ template < typename Edge >
+ void operator()(std::ostream& out, const Edge& e) const
+ {
+ out << "[label=\"" << get(edge_weight, m_g, e) << "\"";
+ typename graph_traits< Graph >::vertex_descriptor u = source(e, m_g),
+ v = target(e, m_g);
+ if (m_parent[v] == u)
+ out << ", color=\"black\"";
+ else
+ out << ", color=\"grey\"";
+ out << "]";
+ }
+ const Graph& m_g;
+ ParentMap m_parent;
};
template < typename Graph, typename Parent >
-edge_writer < Graph, Parent >
-make_edge_writer(const Graph & g, const Parent & p)
+edge_writer< Graph, Parent > make_edge_writer(const Graph& g, const Parent& p)
{
- return edge_writer < Graph, Parent > (g, p);
+ return edge_writer< Graph, Parent >(g, p);
}
-struct EdgeProperties {
- int weight;
+struct EdgeProperties
+{
+ int weight;
};
-int
-main()
+int main()
{
- enum { u, v, x, y, z, N };
- char name[] = { 'u', 'v', 'x', 'y', 'z' };
- typedef std::pair < int, int >E;
- const int n_edges = 10;
- E edge_array[] = { E(u, y), E(u, x), E(u, v), E(v, u),
- E(x, y), E(x, v), E(y, v), E(y, z), E(z, u), E(z,x) };
- int weight[n_edges] = { -4, 8, 5, -2, 9, -3, 7, 2, 6, 7 };
+ enum
+ {
+ u,
+ v,
+ x,
+ y,
+ z,
+ N
+ };
+ char name[] = { 'u', 'v', 'x', 'y', 'z' };
+ typedef std::pair< int, int > E;
+ const int n_edges = 10;
+ E edge_array[] = { E(u, y), E(u, x), E(u, v), E(v, u), E(x, y), E(x, v),
+ E(y, v), E(y, z), E(z, u), E(z, x) };
+ int weight[n_edges] = { -4, 8, 5, -2, 9, -3, 7, 2, 6, 7 };
- typedef adjacency_list < vecS, vecS, directedS,
- no_property, EdgeProperties> Graph;
+ typedef adjacency_list< vecS, vecS, directedS, no_property, EdgeProperties >
+ Graph;
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
- // VC++ can't handle the iterator constructor
- Graph g(N);
- for (std::size_t j = 0; j < n_edges; ++j)
- add_edge(edge_array[j].first, edge_array[j].second, g);
+ // VC++ can't handle the iterator constructor
+ Graph g(N);
+ for (std::size_t j = 0; j < n_edges; ++j)
+ add_edge(edge_array[j].first, edge_array[j].second, g);
#else
- Graph g(edge_array, edge_array + n_edges, N);
+ Graph g(edge_array, edge_array + n_edges, N);
#endif
- graph_traits < Graph >::edge_iterator ei, ei_end;
- property_map::type
- weight_pmap = get(&EdgeProperties::weight, g);
- int i = 0;
- for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei, ++i)
- weight_pmap[*ei] = weight[i];
+ graph_traits< Graph >::edge_iterator ei, ei_end;
+ property_map< Graph, int EdgeProperties::* >::type weight_pmap
+ = get(&EdgeProperties::weight, g);
+ int i = 0;
+ for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei, ++i)
+ weight_pmap[*ei] = weight[i];
- std::vector distance(N, (std::numeric_limits < short >::max)());
- std::vector parent(N);
- for (i = 0; i < N; ++i)
- parent[i] = i;
- distance[z] = 0;
-
-#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
- bool r = bellman_ford_shortest_paths
- (g, int(N), weight_pmap, &parent[0], &distance[0],
- closed_plus(), std::less(), default_bellman_visitor());
-#else
- bool r = bellman_ford_shortest_paths
- (g, int (N), weight_map(weight_pmap).distance_map(&distance[0]).
- predecessor_map(&parent[0]));
-#endif
-
- if (r)
+ std::vector< int > distance(N, (std::numeric_limits< short >::max)());
+ std::vector< std::size_t > parent(N);
for (i = 0; i < N; ++i)
- std::cout << name[i] << ": " << std::setw(3) << distance[i]
- << " " << name[parent[i]] << std::endl;
- else
- std::cout << "negative cycle" << std::endl;
+ parent[i] = i;
+ distance[z] = 0;
- std::ofstream dot_file("figs/bellman-eg.dot");
- dot_file << "digraph D {\n"
- << " rankdir=LR\n"
- << " size=\"5,3\"\n"
- << " ratio=\"fill\"\n"
- << " edge[style=\"bold\"]\n" << " node[shape=\"circle\"]\n";
+#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
+ bool r = bellman_ford_shortest_paths(g, int(N), weight_pmap, &parent[0],
+ &distance[0], closed_plus< int >(), std::less< int >(),
+ default_bellman_visitor());
+#else
+ bool r = bellman_ford_shortest_paths(g, int(N),
+ weight_map(weight_pmap)
+ .distance_map(&distance[0])
+ .predecessor_map(&parent[0]));
+#endif
- {
- for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei) {
- graph_traits < Graph >::edge_descriptor e = *ei;
- graph_traits < Graph >::vertex_descriptor
- u = source(e, g), v = target(e, g);
- // VC++ doesn't like the 3-argument get function, so here
- // we workaround by using 2-nested get()'s.
- dot_file << name[u] << " -> " << name[v]
- << "[label=\"" << get(get(&EdgeProperties::weight, g), e) << "\"";
- if (parent[v] == u)
- dot_file << ", color=\"black\"";
- else
- dot_file << ", color=\"grey\"";
- dot_file << "]";
+ if (r)
+ for (i = 0; i < N; ++i)
+ std::cout << name[i] << ": " << std::setw(3) << distance[i] << " "
+ << name[parent[i]] << std::endl;
+ else
+ std::cout << "negative cycle" << std::endl;
+
+ std::ofstream dot_file("figs/bellman-eg.dot");
+ dot_file << "digraph D {\n"
+ << " rankdir=LR\n"
+ << " size=\"5,3\"\n"
+ << " ratio=\"fill\"\n"
+ << " edge[style=\"bold\"]\n"
+ << " node[shape=\"circle\"]\n";
+
+ {
+ for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
+ {
+ graph_traits< Graph >::edge_descriptor e = *ei;
+ graph_traits< Graph >::vertex_descriptor u = source(e, g),
+ v = target(e, g);
+ // VC++ doesn't like the 3-argument get function, so here
+ // we workaround by using 2-nested get()'s.
+ dot_file << name[u] << " -> " << name[v] << "[label=\""
+ << get(get(&EdgeProperties::weight, g), e) << "\"";
+ if (parent[v] == u)
+ dot_file << ", color=\"black\"";
+ else
+ dot_file << ", color=\"grey\"";
+ dot_file << "]";
+ }
}
- }
- dot_file << "}";
- return EXIT_SUCCESS;
+ dot_file << "}";
+ return EXIT_SUCCESS;
}
diff --git a/example/bellman-ford-internet.cpp b/example/bellman-ford-internet.cpp
index 24bbfef4..a761373d 100644
--- a/example/bellman-ford-internet.cpp
+++ b/example/bellman-ford-internet.cpp
@@ -1,5 +1,5 @@
//=======================================================================
-// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
+// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
@@ -9,55 +9,62 @@
#include
#include
-int
-main()
+int main()
{
- using namespace boost;
- // ID numbers for the routers (vertices).
- enum
- { A, B, C, D, E, F, G, H, n_vertices };
- const int n_edges = 11;
- typedef std::pair < int, int >Edge;
+ using namespace boost;
+ // ID numbers for the routers (vertices).
+ enum
+ {
+ A,
+ B,
+ C,
+ D,
+ E,
+ F,
+ G,
+ H,
+ n_vertices
+ };
+ const int n_edges = 11;
+ typedef std::pair< int, int > Edge;
- // The list of connections between routers stored in an array.
- Edge edges[] = {
- Edge(A, B), Edge(A, C),
- Edge(B, D), Edge(B, E), Edge(C, E), Edge(C, F), Edge(D, H),
- Edge(D, E), Edge(E, H), Edge(F, G), Edge(G, H)
- };
+ // The list of connections between routers stored in an array.
+ Edge edges[] = { Edge(A, B), Edge(A, C), Edge(B, D), Edge(B, E), Edge(C, E),
+ Edge(C, F), Edge(D, H), Edge(D, E), Edge(E, H), Edge(F, G),
+ Edge(G, H) };
- // Specify the graph type and declare a graph object
- typedef edge_list < Edge*, Edge, std::ptrdiff_t, std::random_access_iterator_tag> Graph;
- Graph g(edges, edges + n_edges);
+ // Specify the graph type and declare a graph object
+ typedef edge_list< Edge*, Edge, std::ptrdiff_t,
+ std::random_access_iterator_tag >
+ Graph;
+ Graph g(edges, edges + n_edges);
- // The transmission delay values for each edge.
- float delay[] =
- {5.0, 1.0, 1.3, 3.0, 10.0, 2.0, 6.3, 0.4, 1.3, 1.2, 0.5};
+ // The transmission delay values for each edge.
+ float delay[] = { 5.0, 1.0, 1.3, 3.0, 10.0, 2.0, 6.3, 0.4, 1.3, 1.2, 0.5 };
- // Declare some storage for some "external" vertex properties.
- char name[] = "ABCDEFGH";
- int parent[n_vertices];
- for (int i = 0; i < n_vertices; ++i)
- parent[i] = i;
- float distance[n_vertices];
- std::fill(distance, distance + n_vertices, (std::numeric_limits < float >::max)());
- // Specify A as the source vertex
- distance[A] = 0;
-
- bool r = bellman_ford_shortest_paths(g, int (n_vertices),
- weight_map(make_iterator_property_map
- (&delay[0],
- get(edge_index, g),
- delay[0])).
- distance_map(&distance[0]).
- predecessor_map(&parent[0]));
-
- if (r)
+ // Declare some storage for some "external" vertex properties.
+ char name[] = "ABCDEFGH";
+ int parent[n_vertices];
for (int i = 0; i < n_vertices; ++i)
- std::cout << name[i] << ": " << distance[i]
- << " " << name[parent[i]] << std::endl;
- else
- std::cout << "negative cycle" << std::endl;
+ parent[i] = i;
+ float distance[n_vertices];
+ std::fill(
+ distance, distance + n_vertices, (std::numeric_limits< float >::max)());
+ // Specify A as the source vertex
+ distance[A] = 0;
- return EXIT_SUCCESS;
+ bool r = bellman_ford_shortest_paths(g, int(n_vertices),
+ weight_map(
+ make_iterator_property_map(&delay[0], get(edge_index, g), delay[0]))
+ .distance_map(&distance[0])
+ .predecessor_map(&parent[0]));
+
+ if (r)
+ for (int i = 0; i < n_vertices; ++i)
+ std::cout << name[i] << ": " << distance[i] << " "
+ << name[parent[i]] << std::endl;
+ else
+ std::cout << "negative cycle" << std::endl;
+
+ return EXIT_SUCCESS;
}
diff --git a/example/bfs-example.cpp b/example/bfs-example.cpp
index 0436204c..c42bef15 100644
--- a/example/bfs-example.cpp
+++ b/example/bfs-example.cpp
@@ -1,5 +1,5 @@
//=======================================================================
-// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
+// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
@@ -13,72 +13,83 @@
#include
using namespace boost;
-template < typename TimeMap > class bfs_time_visitor:public default_bfs_visitor {
- typedef typename property_traits < TimeMap >::value_type T;
+template < typename TimeMap >
+class bfs_time_visitor : public default_bfs_visitor
+{
+ typedef typename property_traits< TimeMap >::value_type T;
+
public:
- bfs_time_visitor(TimeMap tmap, T & t):m_timemap(tmap), m_time(t) { }
- template < typename Vertex, typename Graph >
- void discover_vertex(Vertex u, const Graph & g) const
- {
- put(m_timemap, u, m_time++);
- }
- TimeMap m_timemap;
- T & m_time;
+ bfs_time_visitor(TimeMap tmap, T& t) : m_timemap(tmap), m_time(t) {}
+ template < typename Vertex, typename Graph >
+ void discover_vertex(Vertex u, const Graph& g) const
+ {
+ put(m_timemap, u, m_time++);
+ }
+ TimeMap m_timemap;
+ T& m_time;
};
-
-int
-main()
+int main()
{
- using namespace boost;
- // Select the graph type we wish to use
- typedef adjacency_list < vecS, vecS, undirectedS > graph_t;
- // Set up the vertex IDs and names
- enum { r, s, t, u, v, w, x, y, N };
- const char *name = "rstuvwxy";
- // Specify the edges in the graph
- typedef std::pair < int, int >E;
- E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t),
- E(w, x), E(x, t), E(t, u), E(x, y), E(u, y)
- };
- // Create the graph object
- const int n_edges = sizeof(edge_array) / sizeof(E);
+ using namespace boost;
+ // Select the graph type we wish to use
+ typedef adjacency_list< vecS, vecS, undirectedS > graph_t;
+ // Set up the vertex IDs and names
+ enum
+ {
+ r,
+ s,
+ t,
+ u,
+ v,
+ w,
+ x,
+ y,
+ N
+ };
+ const char* name = "rstuvwxy";
+ // Specify the edges in the graph
+ typedef std::pair< int, int > E;
+ E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t), E(w, x),
+ E(x, t), E(t, u), E(x, y), E(u, y) };
+ // Create the graph object
+ const int n_edges = sizeof(edge_array) / sizeof(E);
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
- // VC++ has trouble with the edge iterator constructor
- graph_t g(N);
- for (std::size_t j = 0; j < n_edges; ++j)
- add_edge(edge_array[j].first, edge_array[j].second, g);
+ // VC++ has trouble with the edge iterator constructor
+ graph_t g(N);
+ for (std::size_t j = 0; j < n_edges; ++j)
+ add_edge(edge_array[j].first, edge_array[j].second, g);
#else
- typedef graph_traits::vertices_size_type v_size_t;
- graph_t g(edge_array, edge_array + n_edges, v_size_t(N));
+ typedef graph_traits< graph_t >::vertices_size_type v_size_t;
+ graph_t g(edge_array, edge_array + n_edges, v_size_t(N));
#endif
- // Typedefs
- typedef graph_traits < graph_t >::vertices_size_type Size;
+ // Typedefs
+ typedef graph_traits< graph_t >::vertices_size_type Size;
- // a vector to hold the discover time property for each vertex
- std::vector < Size > dtime(num_vertices(g));
- typedef
- iterator_property_map::iterator,
- property_map::const_type>
- dtime_pm_type;
- dtime_pm_type dtime_pm(dtime.begin(), get(vertex_index, g));
+ // a vector to hold the discover time property for each vertex
+ std::vector< Size > dtime(num_vertices(g));
+ typedef iterator_property_map< std::vector< Size >::iterator,
+ property_map< graph_t, vertex_index_t >::const_type >
+ dtime_pm_type;
+ dtime_pm_type dtime_pm(dtime.begin(), get(vertex_index, g));
- Size time = 0;
- bfs_time_visitor < dtime_pm_type >vis(dtime_pm, time);
- breadth_first_search(g, vertex(s, g), visitor(vis));
+ Size time = 0;
+ bfs_time_visitor< dtime_pm_type > vis(dtime_pm, time);
+ breadth_first_search(g, vertex(s, g), visitor(vis));
- // Use std::sort to order the vertices by their discover time
- std::vector::vertices_size_type > discover_order(N);
- integer_range < int >range(0, N);
- std::copy(range.begin(), range.end(), discover_order.begin());
- std::sort(discover_order.begin(), discover_order.end(),
- indirect_cmp < dtime_pm_type, std::less < Size > >(dtime_pm));
+ // Use std::sort to order the vertices by their discover time
+ std::vector< graph_traits< graph_t >::vertices_size_type > discover_order(
+ N);
+ integer_range< int > range(0, N);
+ std::copy(range.begin(), range.end(), discover_order.begin());
+ std::sort(discover_order.begin(), discover_order.end(),
+ indirect_cmp< dtime_pm_type, std::less< Size > >(dtime_pm));
- std::cout << "order of discovery: ";
- for (int i = 0; i < N; ++i)
- std::cout << name[discover_order[i]] << " ";
- std::cout << std::endl;
+ std::cout << "order of discovery: ";
+ for (int i = 0; i < N; ++i)
+ std::cout << name[discover_order[i]] << " ";
+ std::cout << std::endl;
- return EXIT_SUCCESS;
+ return EXIT_SUCCESS;
}
diff --git a/example/bfs-example2.cpp b/example/bfs-example2.cpp
index bc5d92ab..564c7031 100644
--- a/example/bfs-example2.cpp
+++ b/example/bfs-example2.cpp
@@ -1,5 +1,5 @@
//=======================================================================
-// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
+// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
@@ -14,95 +14,106 @@
#include
using namespace boost;
-template < typename TimeMap > class bfs_time_visitor:public default_bfs_visitor {
- typedef typename property_traits < TimeMap >::value_type T;
-public:
- bfs_time_visitor(TimeMap tmap, T & t):m_timemap(tmap), m_time(t) { }
- template < typename Vertex, typename Graph >
- void discover_vertex(Vertex u, const Graph & g) const
- {
- put(m_timemap, u, m_time++);
- }
- TimeMap m_timemap;
- T & m_time;
-};
-
-
-struct VertexProps {
- boost::default_color_type color;
- std::size_t discover_time;
- unsigned int index;
-};
-
-int
-main()
+template < typename TimeMap >
+class bfs_time_visitor : public default_bfs_visitor
{
- using namespace boost;
- // Select the graph type we wish to use
- typedef adjacency_list < listS, listS, undirectedS,
- VertexProps> graph_t;
- // Set up the vertex IDs and names
- enum { r, s, t, u, v, w, x, y, N };
- const char *name = "rstuvwxy";
- // Specify the edges in the graph
- typedef std::pair < int, int >E;
- E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t),
- E(w, x), E(x, t), E(t, u), E(x, y), E(u, y)
- };
- // Create the graph object
- const int n_edges = sizeof(edge_array) / sizeof(E);
+ typedef typename property_traits< TimeMap >::value_type T;
+
+public:
+ bfs_time_visitor(TimeMap tmap, T& t) : m_timemap(tmap), m_time(t) {}
+ template < typename Vertex, typename Graph >
+ void discover_vertex(Vertex u, const Graph& g) const
+ {
+ put(m_timemap, u, m_time++);
+ }
+ TimeMap m_timemap;
+ T& m_time;
+};
+
+struct VertexProps
+{
+ boost::default_color_type color;
+ std::size_t discover_time;
+ unsigned int index;
+};
+
+int main()
+{
+ using namespace boost;
+ // Select the graph type we wish to use
+ typedef adjacency_list< listS, listS, undirectedS, VertexProps > graph_t;
+ // Set up the vertex IDs and names
+ enum
+ {
+ r,
+ s,
+ t,
+ u,
+ v,
+ w,
+ x,
+ y,
+ N
+ };
+ const char* name = "rstuvwxy";
+ // Specify the edges in the graph
+ typedef std::pair< int, int > E;
+ E edge_array[] = { E(r, s), E(r, v), E(s, w), E(w, r), E(w, t), E(w, x),
+ E(x, t), E(t, u), E(x, y), E(u, y) };
+ // Create the graph object
+ const int n_edges = sizeof(edge_array) / sizeof(E);
#if defined(BOOST_MSVC) && BOOST_MSVC <= 1300
- // VC++ has trouble with the edge iterator constructor
- graph_t g;
- std::vector::vertex_descriptor> verts;
- for (std::size_t i = 0; i < N; ++i)
- verts.push_back(add_vertex(g));
- for (std::size_t j = 0; j < n_edges; ++j)
- add_edge(verts[edge_array[j].first], verts[edge_array[j].second], g);
+ // VC++ has trouble with the edge iterator constructor
+ graph_t g;
+ std::vector< graph_traits< graph_t >::vertex_descriptor > verts;
+ for (std::size_t i = 0; i < N; ++i)
+ verts.push_back(add_vertex(g));
+ for (std::size_t j = 0; j < n_edges; ++j)
+ add_edge(verts[edge_array[j].first], verts[edge_array[j].second], g);
#else
- typedef graph_traits::vertices_size_type v_size_t;
- graph_t g(edge_array, edge_array + n_edges, v_size_t(N));
+ typedef graph_traits< graph_t >::vertices_size_type v_size_t;
+ graph_t g(edge_array, edge_array + n_edges, v_size_t(N));
#endif
- // Typedefs
- typedef graph_traits::vertices_size_type Size;
+ // Typedefs
+ typedef graph_traits< graph_t >::vertices_size_type Size;
- Size time = 0;
- typedef property_map::type dtime_map_t;
- dtime_map_t dtime_map = get(&VertexProps::discover_time, g);
- bfs_time_visitor < dtime_map_t > vis(dtime_map, time);
- breadth_first_search(g, vertex(s, g), color_map(get(&VertexProps::color, g)).
- visitor(vis));
+ Size time = 0;
+ typedef property_map< graph_t, std::size_t VertexProps::* >::type
+ dtime_map_t;
+ dtime_map_t dtime_map = get(&VertexProps::discover_time, g);
+ bfs_time_visitor< dtime_map_t > vis(dtime_map, time);
+ breadth_first_search(
+ g, vertex(s, g), color_map(get(&VertexProps::color, g)).visitor(vis));
- // a vector to hold the discover time property for each vertex
- std::vector < Size > dtime(num_vertices(g));
- typedef
- iterator_property_map::iterator,
- property_map::type>
- dtime_pm_type;
- graph_traits::vertex_iterator vi, vi_end;
- std::size_t c = 0;
- for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi, ++c) {
- dtime[c] = dtime_map[*vi];
- put(&VertexProps::index, g, *vi, c);
- }
- dtime_pm_type dtime_pm(dtime.begin(), get(&VertexProps::index, g));
+ // a vector to hold the discover time property for each vertex
+ std::vector< Size > dtime(num_vertices(g));
+ typedef iterator_property_map< std::vector< Size >::iterator,
+ property_map< graph_t, unsigned int VertexProps::* >::type >
+ dtime_pm_type;
+ graph_traits< graph_t >::vertex_iterator vi, vi_end;
+ std::size_t c = 0;
+ for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi, ++c)
+ {
+ dtime[c] = dtime_map[*vi];
+ put(&VertexProps::index, g, *vi, c);
+ }
+ dtime_pm_type dtime_pm(dtime.begin(), get(&VertexProps::index, g));
- // Use std::sort to order the vertices by their discover time
- std::vector::vertices_size_type > discover_order(N);
- integer_range < int >range(0, N);
- std::copy(range.begin(), range.end(), discover_order.begin());
- std::sort(discover_order.begin(), discover_order.end(),
- make_indirect_cmp(
- std::less(),
- make_iterator_property_map(
- dtime.begin(),
- typed_identity_property_map())));
+ // Use std::sort to order the vertices by their discover time
+ std::vector< graph_traits< graph_t >::vertices_size_type > discover_order(
+ N);
+ integer_range< int > range(0, N);
+ std::copy(range.begin(), range.end(), discover_order.begin());
+ std::sort(discover_order.begin(), discover_order.end(),
+ make_indirect_cmp(std::less< Size >(),
+ make_iterator_property_map(
+ dtime.begin(), typed_identity_property_map< std::size_t >())));
- std::cout << "order of discovery: ";
- for (int i = 0; i < N; ++i)
- std::cout << name[discover_order[i]] << " ";
- std::cout << std::endl;
+ std::cout << "order of discovery: ";
+ for (int i = 0; i < N; ++i)
+ std::cout << name[discover_order[i]] << " ";
+ std::cout << std::endl;
- return EXIT_SUCCESS;
+ return EXIT_SUCCESS;
}
diff --git a/example/bfs-name-printer.cpp b/example/bfs-name-printer.cpp
index aab408d9..bc0da3bc 100644
--- a/example/bfs-name-printer.cpp
+++ b/example/bfs-name-printer.cpp
@@ -1,5 +1,5 @@
//=======================================================================
-// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
+// Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
@@ -12,83 +12,81 @@
#include
using namespace boost;
-template
-void
-build_router_network(Graph & g, VertexNameMap name_map,
- TransDelayMap delay_map)
+template < typename Graph, typename VertexNameMap, typename TransDelayMap >
+void build_router_network(
+ Graph& g, VertexNameMap name_map, TransDelayMap delay_map)
{
- typename graph_traits < Graph >::vertex_descriptor a, b, c, d, e;
- a = add_vertex(g);
- name_map[a] = 'a';
- b = add_vertex(g);
- name_map[b] = 'b';
- c = add_vertex(g);
- name_map[c] = 'c';
- d = add_vertex(g);
- name_map[d] = 'd';
- e = add_vertex(g);
- name_map[e] = 'e';
+ typename graph_traits< Graph >::vertex_descriptor a, b, c, d, e;
+ a = add_vertex(g);
+ name_map[a] = 'a';
+ b = add_vertex(g);
+ name_map[b] = 'b';
+ c = add_vertex(g);
+ name_map[c] = 'c';
+ d = add_vertex(g);
+ name_map[d] = 'd';
+ e = add_vertex(g);
+ name_map[e] = 'e';
- typename graph_traits::edge_descriptor ed;
- bool inserted;
+ typename graph_traits< Graph >::edge_descriptor ed;
+ bool inserted;
- boost::tie(ed, inserted) = add_edge(a, b, g);
- delay_map[ed] = 1.2;
- boost::tie(ed, inserted) = add_edge(a, d, g);
- delay_map[ed] = 4.5;
- boost::tie(ed, inserted) = add_edge(b, d, g);
- delay_map[ed] = 1.8;
- boost::tie(ed, inserted) = add_edge(c, a, g);
- delay_map[ed] = 2.6;
- boost::tie(ed, inserted) = add_edge(c, e, g);
- delay_map[ed] = 5.2;
- boost::tie(ed, inserted) = add_edge(d, c, g);
- delay_map[ed] = 0.4;
- boost::tie(ed, inserted) = add_edge(d, e, g);
- delay_map[ed] = 3.3;
+ boost::tie(ed, inserted) = add_edge(a, b, g);
+ delay_map[ed] = 1.2;
+ boost::tie(ed, inserted) = add_edge(a, d, g);
+ delay_map[ed] = 4.5;
+ boost::tie(ed, inserted) = add_edge(b, d, g);
+ delay_map[ed] = 1.8;
+ boost::tie(ed, inserted) = add_edge(c, a, g);
+ delay_map[ed] = 2.6;
+ boost::tie(ed, inserted) = add_edge(c, e, g);
+ delay_map[ed] = 5.2;
+ boost::tie(ed, inserted) = add_edge(d, c, g);
+ delay_map[ed] = 0.4;
+ boost::tie(ed, inserted) = add_edge(d, e, g);
+ delay_map[ed] = 3.3;
}
-
-template
-class bfs_name_printer : public default_bfs_visitor {
- // inherit default (empty) event point actions
+template < typename VertexNameMap >
+class bfs_name_printer : public default_bfs_visitor
+{
+ // inherit default (empty) event point actions
public:
- bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) {
- }
- template
- void discover_vertex(Vertex u, const Graph &) const
- {
- std::cout << get(m_name_map, u) << ' ';
- }
+ bfs_name_printer(VertexNameMap n_map) : m_name_map(n_map) {}
+ template < typename Vertex, typename Graph >
+ void discover_vertex(Vertex u, const Graph&) const
+ {
+ std::cout << get(m_name_map, u) << ' ';
+ }
+
private:
- VertexNameMap m_name_map;
+ VertexNameMap m_name_map;
};
-struct VP {
- char name;
-};
-
-struct EP {
- double weight;
-};
-
-
-int
-main()
+struct VP
{
- typedef adjacency_list < listS, vecS, directedS, VP, EP> graph_t;
- graph_t g;
+ char name;
+};
- property_map
