DIJKSTRA(G, s, w)
for each vertex u in V (This loop is not run in dijkstra_shortest_paths_no_init)
- d[u] := infinity
- p[u] := u
+ d[u] := infinity
+ p[u] := u
color[u] := WHITE
end for
- color[s] := GRAY
- d[s] := 0
+ color[s] := GRAY
+ d[s] := 0
INSERT(Q, s)
while (Q != Ø)
u := EXTRACT-MIN(Q)
@@ -136,10 +136,10 @@
for each vertex v in Adj[u]
if (w(u,v) + d[u] < d[v])
d[v] := w(u,v) + d[u]
- p[v] := u
- if (color[v] = WHITE)
+ p[v] := u
+ if (color[v] = WHITE)
color[v] := GRAY
- INSERT(Q, v)
+ INSERT(Q, v)
else if (color[v] = GRAY)
DECREASE-KEY(Q, v)
else
@@ -188,17 +188,17 @@ Where Defined
Parameters
-IN: const Graph& g
+IN: const Graph& g
The graph object on which the algorithm will be applied.
- The type Graph must be a model of
+ The type Graph must be a model of
Vertex List Graph
and Incidence Graph.
Python: The parameter is named graph.
-IN: vertex_descriptor s
+IN: vertex_descriptor s
The source vertex. All distance will be calculated from this vertex,
and the shortest paths tree will be rooted at this vertex.
@@ -208,11 +208,11 @@ Parameters
Named Parameters
-IN: weight_map(WeightMap w_map)
+IN: weight_map(WeightMap w_map)
The weight or ``length'' of each edge in the graph. The weights
must all be non-negative, and the algorithm will throw a
- negative_edge
+ negative_edge
exception is one of the edges is negative.
The type WeightMap must be a model of
Readable Property Map. The edge descriptor type of
@@ -225,13 +225,13 @@ Named Parameters
Python default: graph.get_edge_double_map("weight")
-IN: vertex_index_map(VertexIndexMap i_map)
+IN: vertex_index_map(VertexIndexMap i_map)
This maps each vertex to an integer in the range [0,
num_vertices(g)). This is necessary for efficient updates of the
heap data structure [61] when an edge is relaxed.
- The type
+ The type
VertexIndexMap must be a model of
Readable Property Map. The value type of the map must be an
integer type. The vertex descriptor type of the graph needs to be
@@ -246,10 +246,10 @@ Named Parameters
Python: Unsupported parameter.
-OUT: predecessor_map(PredecessorMap p_map)
+OUT: predecessor_map(PredecessorMap p_map)
The predecessor map records the edges in the shortest path tree, the tree computed
- by the traversal of the graph. Upon completion of the algorithm, the edges
+ by the traversal of the graph. Upon completion of the algorithm, the edges
(p[u],u) for all u in V are in the tree. The shortest path
from vertex s to each vertex v in the graph consists of the
vertices v, p[v], p[p[v]], and so on until s is
@@ -266,7 +266,7 @@ Named Parameters
Python: Must be a vertex_vertex_map for the graph.
-UTIL/OUT: distance_map(DistanceMap d_map)
+UTIL/OUT: 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
@@ -274,7 +274,7 @@ Named Parameters
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.
The value type of the distance map is the element type of a Monoid formed with the combine
@@ -293,7 +293,7 @@ Named Parameters
Python: Must be a vertex_double_map for the graph.
-IN: distance_compare(CompareFunction cmp)
+IN: distance_compare(CompareFunction cmp)
This function is use to compare distances to determine which vertex
is closer to the source vertex. The CompareFunction type
@@ -309,7 +309,7 @@ Named Parameters
Python: Unsupported parameter.
-IN: distance_combine(CombineFunction cmb)
+IN: distance_combine(CombineFunction cmb)
This function is used to combine distances to compute the distance
of a path. The CombineFunction type must be a model of Named Parameters
Python: Unsupported parameter.
-IN: distance_inf(D inf)
+IN: distance_inf(D inf)
The inf object must be the greatest value of any D object.
That is, compare(d, inf) == true for any d != inf.
@@ -338,7 +338,7 @@ Named Parameters
Python: Unsupported parameter.
-IN: distance_zero(D zero)
+IN: distance_zero(D zero)
The zero value must be the identity element for the
Monoid formed by the distance values
@@ -350,7 +350,7 @@ Named Parameters
Python: Unsupported parameter.
-UTIL/OUT: color_map(ColorMap c_map)
+UTIL/OUT: color_map(ColorMap c_map)
This is used during the execution of the algorithm to mark the
vertices. The vertices start out white and become gray when they are
@@ -371,13 +371,13 @@ Named Parameters
Python: The color map must be a vertex_color_map for
the graph.
-
-OUT: visitor(DijkstraVisitor v)
+
+OUT: visitor(DijkstraVisitor v)
Use this to specify actions that you would like to happen
during certain event points within the algorithm.
The type DijkstraVisitor must be a model of the
- Dijkstra Visitor concept.
+ Dijkstra Visitor concept.
The visitor object is passed by value [2].
Default: dijkstra_visitor<null_visitor>
@@ -404,19 +404,19 @@ Visitor Event Points
vis.examine_vertex(u, g)
is invoked on a vertex as it is removed from the priority queue
and added to set S. At this point we know that (p[u],u)
- is a shortest-paths tree edge so
- d[u] = delta(s,u) = d[p[u]] + w(p[u],u). Also, the distances
+ is a shortest-paths tree edge so
+ d[u] = delta(s,u) = d[p[u]] + w(p[u],u). Also, the distances
of the examined vertices is monotonically increasing
- d[u1] <= d[u2] <= d[un].
+ d[u1] <= d[u2] <= d[un].
vis.examine_edge(e, g)
is invoked on each out-edge of a vertex immediately after it has
- been added to set S.
+ been added to set S.
vis.edge_relaxed(e, g)
is invoked on edge (u,v) if d[u] + w(u,v) < d[v].
The edge (u,v) that participated in the last
- relaxation for vertex v is an edge in the shortest paths tree.
+ relaxation for vertex v is an edge in the shortest paths tree.
vis.discover_vertex(v, g)
- is invoked on vertex v when the edge
+ is invoked on vertex v when the edge
(u,v) is examined and v is WHITE. Since
a vertex is colored GRAY when it is discovered,
each reachable vertex is discovered exactly once. This
@@ -445,7 +445,7 @@ Notes
vertices in V - S that are discovered and therefore have a
distance less than infinity.
-[2]
+
[2]
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
@@ -461,4 +461,4 @@
Notes
-
+
diff --git a/doc/dijkstra_shortest_paths_no_color_map.html b/doc/dijkstra_shortest_paths_no_color_map.html
index 05c3aec51..07432082d 100644
--- a/doc/dijkstra_shortest_paths_no_color_map.html
+++ b/doc/dijkstra_shortest_paths_no_color_map.html
@@ -1,17 +1,17 @@
Boost Graph Library: Dijkstra's Shortest Paths (No Color Map)
-
-
+
+
@@ -27,29 +27,29 @@
(const Graph& graph,
typename graph_traits<Graph>::vertex_descriptor start_vertex,
const bgl_named_params& params);
-
+
// non-named parameter version
-template <typename Graph, typename DijkstraVisitor,
+template <typename Graph, typename DijkstraVisitor,
typename PredecessorMap, typename DistanceMap,
- typename WeightMap, typename VertexIndexMap, typename DistanceCompare, typename DistanceWeightCombine,
+ typename WeightMap, typename VertexIndexMap, typename DistanceCompare, typename DistanceWeightCombine,
typename DistanceInfinity, typename DistanceZero>
void dijkstra_shortest_paths_no_color_map
(const Graph& graph,
- typename graph_traits<Graph>::vertex_descriptor start_vertex,
- PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map,
+ typename graph_traits<Graph>::vertex_descriptor start_vertex,
+ PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map,
VertexIndexMap index_map,
DistanceCompare distance_compare, DistanceWeightCombine distance_weight_combine,
DistanceInfinity distance_infinity, DistanceZero distance_zero);
// version that does not initialize the property maps
-template <typename Graph, typename DijkstraVisitor,
+template <typename Graph, typename DijkstraVisitor,
typename PredecessorMap, typename DistanceMap,
- typename WeightMap, typename VertexIndexMap, typename DistanceCompare, typename DistanceWeightCombine,
+ typename WeightMap, typename VertexIndexMap, typename DistanceCompare, typename DistanceWeightCombine,
typename DistanceInfinity, typename DistanceZero>
void dijkstra_shortest_paths_no_color_map_no_init
(const Graph& graph,
- typename graph_traits<Graph>::vertex_descriptor start_vertex,
- PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map,
+ typename graph_traits<Graph>::vertex_descriptor start_vertex,
+ PredecessorMap predecessor_map, DistanceMap distance_map, WeightMap weight_map,
VertexIndexMap index_map,
DistanceCompare distance_compare, DistanceWeightCombine distance_weight_combine,
DistanceInfinity distance_infinity, DistanceZero distance_zero);
@@ -116,16 +116,16 @@
DIJKSTRA(G, s, w)
- d[s] := 0
+ d[s] := 0
INSERT(Q, s)
while (Q != Ø)
u := EXTRACT-MIN(Q)
for each vertex v in Adj[u]
if (w(u,v) + d[u] < d[v])
d[v] := w(u,v) + d[u]
- p[v] := u
- if (d[v] was originally infinity)
- INSERT(Q, v)
+ p[v] := u
+ if (d[v] was originally infinity)
+ INSERT(Q, v)
else
DECREASE-KEY(Q, v)
else
@@ -164,15 +164,15 @@ Where Defined
Parameters
-IN: const Graph& graph
+IN: const Graph& graph
The graph object on which the algorithm will be applied.
- The type Graph must be a model of
+ The type Graph must be a model of
Vertex List Graph
and Incidence Graph.
-IN: vertex_descriptor start_vertex
+IN: vertex_descriptor start_vertex
The source vertex. All distance will be calculated from this vertex,
and the shortest paths tree will be rooted at this vertex.
@@ -180,11 +180,11 @@ Parameters
Named Parameters
-IN: weight_map(WeightMap weight_map)
+IN: weight_map(WeightMap weight_map)
The weight or ``length'' of each edge in the graph. The weights
must all be non-negative and non-infinite [3]. The algorithm will throw a
- negative_edge
+ negative_edge
exception is one of the edges is negative.
The type WeightMap must be a model of
Readable Property Map. The edge descriptor type of
@@ -194,13 +194,13 @@ Named Parameters
Default: get(edge_weight, graph)
-IN: index_map(VertexIndexMap index_map)
+IN: index_map(VertexIndexMap index_map)
This maps each vertex to an integer in the range [0,
num_vertices(graph)). This is necessary for efficient updates of the
heap data structure [61] when an edge is relaxed.
- The type
+ The type
VertexIndexMap must be a model of
Readable Property Map. The value type of the map must be an
integer type. The vertex descriptor type of the graph needs to be
@@ -213,7 +213,7 @@ Named Parameters
-OUT: predecessor_map(PredecessorMap predecessor_map)
+OUT: predecessor_map(PredecessorMap predecessor_map)
The predecessor map records the edges in the minimum spanning
tree. Upon completion of the algorithm, the edges (p[u],u)
@@ -229,7 +229,7 @@ Named Parameters
Python: Must be a vertex_vertex_map for the graph.
-UTIL/OUT: distance_map(DistanceMap distance_map)
+UTIL/OUT: distance_map(DistanceMap distance_map)
The shortest path weight from the source vertex start_vertex to each
vertex in the graph graph is recorded in this property map. The
@@ -237,7 +237,7 @@ Named Parameters
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.
The value type of the distance map is the element type of a Monoid formed with the distance_weight_combine
@@ -254,7 +254,7 @@ Named Parameters
map.
-IN: distance_compare(CompareFunction distance_compare)
+IN: distance_compare(CompareFunction distance_compare)
This function is use to compare distances to determine which vertex
is closer to the source vertex. The DistanceCompareFunction type
@@ -268,7 +268,7 @@ Named Parameters
property_traits<DistanceMap>::value_type
-IN: distance_combine(CombineFunction distance_weight_combine)
+IN: distance_combine(CombineFunction distance_weight_combine)
This function is used to combine distances to compute the distance
of a path. The DistanceWeightCombineFunction type must be a model of Named Parameters
D=typename property_traits<DistanceMap>::value_type
-IN: distance_inf(D distance_infinity)
+IN: distance_inf(D distance_infinity)
The distance_infinity object must be the greatest value of any D object.
That is, distance_compare(d, distance_infinity) == true for any d != distance_infinity.
@@ -293,7 +293,7 @@ Named Parameters
Default: std::numeric_limits<D>::max()
-IN: distance_zero(D distance_zero)
+IN: distance_zero(D distance_zero)
The distance_zero value must be the identity element for the
Monoid formed by the distance values
@@ -302,13 +302,13 @@ Named Parameters
Default: D()with
D=typename property_traits<DistanceMap>::value_type
-
-OUT: visitor(DijkstraVisitor v)
+
+OUT: visitor(DijkstraVisitor v)
Use this to specify actions that you would like to happen
during certain event points within the algorithm.
The type DijkstraVisitor must be a model of the
- Dijkstra Visitor concept.
+ Dijkstra Visitor concept.
The visitor object is passed by value [2].
Default: dijkstra_visitor<null_visitor>
@@ -330,19 +330,19 @@ Visitor Event Points
vis.examine_vertex(u, g)
is invoked on a vertex as it is removed from the priority queue
and added to set S. At this point we know that (p[u],u)
- is a shortest-paths tree edge so
- d[u] = delta(s,u) = d[p[u]] + w(p[u],u). Also, the distances
+ is a shortest-paths tree edge so
+ d[u] = delta(s,u) = d[p[u]] + w(p[u],u). Also, the distances
of the examined vertices is monotonically increasing
- d[u1] <= d[u2] <= d[un].
+ d[u1] <= d[u2] <= d[un].
vis.examine_edge(e, g)
is invoked on each out-edge of a vertex immediately after it has
- been added to set S.
+ been added to set S.
vis.edge_relaxed(e, g)
is invoked on edge (u,v) if d[u] + w(u,v) < d[v].
The edge (u,v) that participated in the last
- relaxation for vertex v is an edge in the shortest paths tree.
+ relaxation for vertex v is an edge in the shortest paths tree.
vis.discover_vertex(v, g)
- is invoked on vertex v when the edge
+ is invoked on vertex v when the edge
(u,v) is examined and v has not yet been discovered (i.e. its distance was infinity before relaxation was attempted on the edge). This
is also when the vertex is inserted into the priority queue.
vis.edge_not_relaxed(e, g)
@@ -370,17 +370,17 @@ Notes
vertices in V - S that are discovered and therefore have a
distance less than infinity.
-[2]
+ [2]
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
passed in. Therefore you may want the visitor to hold this state by
pointer or reference.
-
- [3]
+
+ [3]
The algorithm will not work correctly if any of the edge weights are equal to infinity since the infinite distance value is used to determine if a vertex has been discovered.
-
- [4]
+
+ [4]
Calls to the visitor events occur in the same order as dijkstra_shortest_paths (i.e. discover_vertex(u) will always be called after examine_vertex(u) for an undiscovered vertex u). However, the vertices of the graph given to dijkstra_shortest_paths_no_color_map will not necessarily be visited in the same order as dijkstra_shortest_paths.
@@ -391,4 +391,4 @@ Notes
Trustees of Indiana University |
-
+
diff --git a/doc/dijkstra_visitor.html b/doc/dijkstra_visitor.html
index 5ad9db1de..ac4b3cb3a 100644
--- a/doc/dijkstra_visitor.html
+++ b/doc/dijkstra_visitor.html
@@ -1,17 +1,17 @@
Boost Graph Library: dijkstra_visitor
-
-
+
+
@@ -37,7 +37,7 @@ Example
boost::dijkstra_shortest_paths
- (G, vertex(a, G),
+ (G, vertex(a, G),
distance_map(make_iterator_property_map(distance.begin(), vertex_id, distance[0])).
predecessor_map(make_iterator_property_map(parent.begin(), vertex_id, parent[0])).
visitor(make_dijkstra_visitor(copy_graph(G_copy, on_examine_edge()))));
@@ -122,4 +122,4 @@ See Also
-
+
diff --git a/doc/directed_graph.html b/doc/directed_graph.html
index c20b23830..a410153e8 100644
--- a/doc/directed_graph.html
+++ b/doc/directed_graph.html
@@ -1,17 +1,17 @@
Boost Graph Library: Directed Graph
-
-
+
+
@@ -93,4 +93,4 @@ Where Defined
-
+
diff --git a/doc/disjoint_sets.html b/doc/disjoint_sets.html
index 34cce558d..eaebe45a4 100644
--- a/doc/disjoint_sets.html
+++ b/doc/disjoint_sets.html
@@ -73,7 +73,7 @@ Example
...
disjoint_sets<Rank, Parent, FindCompress> dsets(rank, p);
-
+
for (ui = vertices(G).first; ui != vertices(G).second; ++ui)
dsets.make_set(*ui);
...
@@ -282,7 +282,7 @@
-
Revised
+
Revised
01
December, 2006
diff --git a/doc/disjoint_sets_biblio.html b/doc/disjoint_sets_biblio.html
index ec9e88324..96132347c 100644
--- a/doc/disjoint_sets_biblio.html
+++ b/doc/disjoint_sets_biblio.html
@@ -37,7 +37,7 @@ Bibliography
"../../doc/images/valid-html401.png" alt="Valid HTML 4.01 Transitional"
height="31" width="88">
- Revised
+
Revised
01
December, 2006
diff --git a/doc/distance_recorder.html b/doc/distance_recorder.html
index 9786371f4..50daaa447 100644
--- a/doc/distance_recorder.html
+++ b/doc/distance_recorder.html
@@ -1,17 +1,17 @@
Boost Graph Library: distance_recorder
-
-
+
+
@@ -124,7 +124,7 @@ Member Functions
void operator()(Edge e, const Graph& g);
-Given edge e = (u,v), this records the distance of v as
+Given edge e = (u,v), this records the distance of v as
one plus the distance of u.
|
@@ -173,7 +173,7 @@ See Also
-
+
Boost Graph Library: Edge List Class
-
-
+
+
@@ -52,7 +52,7 @@ Example
E(x,y), E(x,v),
E(y,v), E(y,z),
E(z,u), E(z,x) };
-
+
int weight[] = { -4, 8, 5,
-2,
9, -3,
@@ -61,16 +61,16 @@ Example
typedef boost::edge_list<E*> Graph;
Graph g(edges, edges + sizeof(edges) / sizeof(E));
-
+
std::vector<int> distance(N, std::numeric_limits<short>::max());
std::vector<int> parent(N,-1);
-
+
distance[z] = 0;
parent[z] = z;
bool r = boost::bellman_ford_shortest_paths(g, int(N), weight,
distance.begin(),
parent.begin());
- if (r)
+ if (r)
for (int i = 0; i < N; ++i)
std::cout << name[i] << ": " << distance[i]
<< " " << name[parent[i]] << std::endl;
@@ -145,7 +145,7 @@ Associated Types
The type for the edge descriptors associated with the
-edge_list.
+edge_list.
@@ -218,4 +218,4 @@ Non-Member Functions
-
+
diff --git a/doc/edge_predecessor_recorder.html b/doc/edge_predecessor_recorder.html
index e9bee01dc..f4b0be765 100644
--- a/doc/edge_predecessor_recorder.html
+++ b/doc/edge_predecessor_recorder.html
@@ -1,17 +1,17 @@
Boost Graph Library: edge_predecessor_recorder
-
-
+
+
@@ -188,7 +188,7 @@ See Also
-
+
Boost Graph Library: Edmonds-Karp Maximum Flow
-
-
+
+
@@ -23,20 +23,20 @@
// named parameter version
template <class Graph, class P, class T, class R>
typename detail::edge_capacity_value<Graph, P, T, R>::value_type
-edmonds_karp_max_flow(Graph& g,
+edmonds_karp_max_flow(Graph& g,
typename graph_traits<Graph>::vertex_descriptor src,
typename graph_traits<Graph>::vertex_descriptor sink,
const bgl_named_params<P, T, R>& params = all defaults)
// non-named parameter version
-template <class Graph,
+template <class Graph,
class CapacityEdgeMap, class ResidualCapacityEdgeMap,
class ReverseEdgeMap, class ColorMap, class PredEdgeMap>
typename property_traits<CapacityEdgeMap>::value_type
-edmonds_karp_max_flow(Graph& g,
+edmonds_karp_max_flow(Graph& g,
typename graph_traits<Graph>::vertex_descriptor src,
typename graph_traits<Graph>::vertex_descriptor sink,
- CapacityEdgeMap cap, ResidualCapacityEdgeMap res, ReverseEdgeMap rev,
+ CapacityEdgeMap cap, ResidualCapacityEdgeMap res, ReverseEdgeMap rev,
ColorMap color, PredEdgeMap pred)
@@ -48,7 +48,7 @@
-
+
OUT: residual_capacity_map(ResidualCapacityEdgeMap res)
This maps edges to their residual capacity. The type must be a model
@@ -228,7 +228,7 @@ See Also
-
+
Boost Graph Library: Exceptions
-
-
+
+
diff --git a/doc/faq.html b/doc/faq.html
index c77fca5db..53c9c38f6 100644
--- a/doc/faq.html
+++ b/doc/faq.html
@@ -1,17 +1,17 @@
Boost Graph Library: FAQ
-
-
+
+
@@ -76,8 +76,8 @@ Frequently Asked Questions
weren't other strong reasons, it was enough for us to choose free
functions.
-
-
+
+
Our religious reason for choosing free functions is to send the message
that BGL is a generic library, and not a traditional object-oriented
library. OO was hip in the 80s and 90s, but its time we moved beyond!
@@ -124,13 +124,13 @@
Frequently Asked Questions
not being found, such as:
../../../boost/concept_check.hpp:209: no match for
-`boost::detail::error_property_not_found & ==
+`boost::detail::error_property_not_found & ==
boost::detail::error_property_not_found &'
or a message such as:
../../..\boost/graph/depth_first_search.hpp(78) : error C2664: 'white'
-: cannot convert parameter 1 from
+: cannot convert parameter 1 from
'struct boost::detail::error_property_not_found'
to 'enum boost::default_color_type'
diff --git a/doc/figs/adj_list.fig b/doc/figs/adj_list.fig
index ebe19a3b2..82bd57e47 100644
--- a/doc/figs/adj_list.fig
+++ b/doc/figs/adj_list.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/adj_matrix.fig b/doc/figs/adj_matrix.fig
index a0664312e..5f8985e16 100644
--- a/doc/figs/adj_matrix.fig
+++ b/doc/figs/adj_matrix.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/analogy.fig b/doc/figs/analogy.fig
index 079ad97bc..dfc0e95fc 100644
--- a/doc/figs/analogy.fig
+++ b/doc/figs/analogy.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/back_edges.fig b/doc/figs/back_edges.fig
index f36892e81..842435104 100644
--- a/doc/figs/back_edges.fig
+++ b/doc/figs/back_edges.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/bfs_example.fig b/doc/figs/bfs_example.fig
index 4adf2a91f..ad1dec960 100644
--- a/doc/figs/bfs_example.fig
+++ b/doc/figs/bfs_example.fig
@@ -2,7 +2,7 @@
Portrait
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/bfs_family.fig b/doc/figs/bfs_family.fig
index f3de67c68..ad40d897f 100644
--- a/doc/figs/bfs_family.fig
+++ b/doc/figs/bfs_family.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/bfs_visitor.fig b/doc/figs/bfs_visitor.fig
index cb85d86b1..0996cf83f 100644
--- a/doc/figs/bfs_visitor.fig
+++ b/doc/figs/bfs_visitor.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/concepts.fig b/doc/figs/concepts.fig
index d976f733a..97b2f9bd9 100644
--- a/doc/figs/concepts.fig
+++ b/doc/figs/concepts.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/dfs.fig b/doc/figs/dfs.fig
index aff4b2b8d..45feb4e9c 100644
--- a/doc/figs/dfs.fig
+++ b/doc/figs/dfs.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/dfs_example.fig b/doc/figs/dfs_example.fig
index ebd3cdfcb..021adae9e 100644
--- a/doc/figs/dfs_example.fig
+++ b/doc/figs/dfs_example.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/dfs_family.fig b/doc/figs/dfs_family.fig
index aa3958ac1..851eb868c 100644
--- a/doc/figs/dfs_family.fig
+++ b/doc/figs/dfs_family.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/dfs_visitor.fig b/doc/figs/dfs_visitor.fig
index d4d351a66..0d2a284c6 100644
--- a/doc/figs/dfs_visitor.fig
+++ b/doc/figs/dfs_visitor.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/digraph.fig b/doc/figs/digraph.fig
index d6fc204a5..a56b4cca3 100644
--- a/doc/figs/digraph.fig
+++ b/doc/figs/digraph.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/disjoint_set_family.fig b/doc/figs/disjoint_set_family.fig
index 309904282..0a71d0017 100644
--- a/doc/figs/disjoint_set_family.fig
+++ b/doc/figs/disjoint_set_family.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/edge_list.fig b/doc/figs/edge_list.fig
index dc3759754..cce549ce0 100644
--- a/doc/figs/edge_list.fig
+++ b/doc/figs/edge_list.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/file_dep.fig b/doc/figs/file_dep.fig
index 1259102a8..edd41f1f8 100644
--- a/doc/figs/file_dep.fig
+++ b/doc/figs/file_dep.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/forward_or_cross_edges.fig b/doc/figs/forward_or_cross_edges.fig
index d88245a79..b7dc619ee 100644
--- a/doc/figs/forward_or_cross_edges.fig
+++ b/doc/figs/forward_or_cross_edges.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/graph_search.fig b/doc/figs/graph_search.fig
index ef66e059a..ffc67b99c 100644
--- a/doc/figs/graph_search.fig
+++ b/doc/figs/graph_search.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/knights_tour.fig b/doc/figs/knights_tour.fig
index 5035bcf4a..d9a4e1213 100644
--- a/doc/figs/knights_tour.fig
+++ b/doc/figs/knights_tour.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/quick_start.fig b/doc/figs/quick_start.fig
index 23226637f..e71c7aed4 100644
--- a/doc/figs/quick_start.fig
+++ b/doc/figs/quick_start.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/search_states.fig b/doc/figs/search_states.fig
index f44776f5f..b3109807a 100644
--- a/doc/figs/search_states.fig
+++ b/doc/figs/search_states.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/tree_edges.fig b/doc/figs/tree_edges.fig
index 6143bc8b0..747c91330 100644
--- a/doc/figs/tree_edges.fig
+++ b/doc/figs/tree_edges.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/undigraph.fig b/doc/figs/undigraph.fig
index 776037611..d2e0d691b 100644
--- a/doc/figs/undigraph.fig
+++ b/doc/figs/undigraph.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/figs/visitor.fig b/doc/figs/visitor.fig
index d4d351a66..0d2a284c6 100644
--- a/doc/figs/visitor.fig
+++ b/doc/figs/visitor.fig
@@ -2,7 +2,7 @@
Landscape
Center
Inches
-Letter
+Letter
100.00
Single
-2
diff --git a/doc/file_dependency_example.html b/doc/file_dependency_example.html
index f5def38c5..bbf1d03eb 100644
--- a/doc/file_dependency_example.html
+++ b/doc/file_dependency_example.html
@@ -1,17 +1,17 @@
File Dependency Example
-
-
+
+
@@ -108,9 +108,9 @@ Graph Setup
- enum files_e { dax_h, yow_h, boz_h, zow_h, foo_cpp,
+ enum files_e { dax_h, yow_h, boz_h, zow_h, foo_cpp,
foo_o, bar_cpp, bar_o, libfoobar_a,
- zig_cpp, zig_o, zag_cpp, zag_o,
+ zig_cpp, zig_o, zag_cpp, zag_o,
libzigzag_a, killerapp, N };
const char* name[] = { "dax.h", "yow.h", "boz.h", "zow.h", "foo.cpp",
"foo.o", "bar.cpp", "bar.o", "libfoobar.a",
@@ -122,7 +122,7 @@ Graph Setup
Edge(dax_h, foo_cpp), Edge(dax_h, bar_cpp), Edge(dax_h, yow_h),
Edge(yow_h, bar_cpp), Edge(yow_h, zag_cpp),
Edge(boz_h, bar_cpp), Edge(boz_h, zig_cpp), Edge(boz_h, zag_cpp),
- Edge(zow_h, foo_cpp),
+ Edge(zow_h, foo_cpp),
Edge(foo_cpp, foo_o),
Edge(foo_o, libfoobar_a),
Edge(bar_cpp, bar_o),
@@ -136,7 +136,7 @@ Graph Setup
};
using namespace boost;
- typedef adjacency_list<vecS, vecS, bidirectionalS,
+ typedef adjacency_list<vecS, vecS, bidirectionalS,
property<vertex_color_t, default_color_type>
> Graph;
Graph g(used_by, used_by + sizeof(used_by) / sizeof(Edge), N);
@@ -175,7 +175,7 @@ Compilation Order (All Files)
typedef std::list<Vertex> MakeOrder;
MakeOrder make_order;
boost::topological_sort(g, std::front_inserter(make_order));
-
+
std::cout << "make ordering: ";
for (MakeOrder::iterator i = make_order.begin();
i != make_order.end(); ++i)
@@ -229,7 +229,7 @@
zero.
- for (i = make_order.begin(); i != make_order.end(); ++i) {
+ for (i = make_order.begin(); i != make_order.end(); ++i) {
if (in_degree (*i, g) > 0) {
Graph::in_edge_iterator j, j_end;
int maxdist = 0;
@@ -253,8 +253,8 @@
The output is:
- parallel make ordering,
- vertices with same group number
+ parallel make ordering,
+ vertices with same group number
can be made in parallel
time_slot[dax.h] = 0
time_slot[yow.h] = 1
@@ -289,7 +289,7 @@
href="./depth_first_search.html">depth-first search, and if the
search runs into an already discovered vertex (of the current search
tree), then there is a cycle. The BGL graph search algorithms (which
-includes
+includes
depth_first_search()) are all extensible via the
visitor mechanism. A visitor is similar to a function object,
but it has several methods instead of just the one
@@ -304,7 +304,7 @@
method, which is the DFSVisitor method
that is called when DFS explores an edge to an already discovered
vertex. A call to this method indicates the existence of a
-cycle. Inheriting from dfs_visitor<>
+cycle. Inheriting from dfs_visitor<>
provides the visitor with empty versions of the other visitor methods.
Once our visitor is created, we can construct and object and pass it
to the BGL algorithm. Visitor objects are passed by value inside of
@@ -315,7 +315,7 @@
struct cycle_detector : public dfs_visitor<>
{
- cycle_detector( bool& has_cycle)
+ cycle_detector( bool& has_cycle)
: _has_cycle(has_cycle) { }
template <class Edge, class Graph>
@@ -360,4 +360,4 @@
-
+
diff --git a/doc/filtered_graph.html b/doc/filtered_graph.html
index 2b4b9675a..66527b0e9 100644
--- a/doc/filtered_graph.html
+++ b/doc/filtered_graph.html
@@ -1,17 +1,17 @@
Boost Graph Library: Filtered Graph
-
-
+
+
@@ -71,7 +71,7 @@ Example
int main()
{
using namespace boost;
-
+
typedef adjacency_list<vecS, vecS, directedS,
no_property, property<edge_weight_t, int> > Graph;
typedef property_map<Graph, edge_weight_t>::type EdgeWeightMap;
@@ -85,7 +85,7 @@ Example
add_edge(C, E, 0, g);
add_edge(D, B, 3, g);
add_edge(E, C, 0, g);
-
+
positive_edge_weight<EdgeWeightMap> filter(get(edge_weight, g));
filtered_graph<Graph, positive_edge_weight<EdgeWeightMap> >
fg(g, filter);
@@ -95,19 +95,19 @@ Example
std::cout << "filtered out-edges:" << std::endl;
print_graph(fg, name);
-
+
return 0;
}
The output is:
-filtered edge set: (A,B) (C,D) (D,B)
+filtered edge set: (A,B) (C,D) (D,B)
filtered out-edges:
-A --> B
-B -->
-C --> D
-D --> B
-E -->
+A --> B
+B -->
+C --> D
+D --> B
+E -->
@@ -274,7 +274,7 @@
Associated Types
and
property_map<filtered_graph, Property>::const_type
-The property map type for vertex or edge properties in the graph.
+The property map type for vertex or edge properties in the graph.
The same property maps from the adapted graph are available
in the filtered graph.
@@ -405,7 +405,7 @@ Structure Access
degree_size_type
in_degree(vertex_descriptor u, const filtered_graph& g)
-Returns the number of edges entering vertex u.
+Returns the number of edges entering vertex u.
@@ -413,7 +413,7 @@ Structure Access
vertices_size_type
num_vertices(const filtered_graph& g)
-Returns the number of vertices in the underlying graph [2].
+Returns the number of vertices in the underlying graph [2].
@@ -514,7 +514,7 @@ Notes
calculate, and the second is that it would interact badly with the
underlying vertex/edge index mappings. The index mapping would no
longer fall in the range [0,num_vertices(g)) (resp. [0,
-num_edges(g))) which is assumed in many of the algorithms.
+num_edges(g))) which is assumed in many of the algorithms.
@@ -532,4 +532,4 @@ Notes
-
+
diff --git a/doc/find_flow_cost.html b/doc/find_flow_cost.html
index 7f839cf90..63c0274be 100644
--- a/doc/find_flow_cost.html
+++ b/doc/find_flow_cost.html
@@ -1,17 +1,17 @@
Boost Graph Library: Find Flow Cost
-
-
+
+
@@ -29,19 +29,19 @@
// non-named parameter version
template<class Graph, class Capacity, class ResidualCapacity, class Weight>
typename property_traits<typename property_map < Graph, edge_capacity_t >::type>::value_type
-find_flow_cost(const Graph & g, Capacity capacity, ResidualCapacity residual_capacity, Weight weight)
+find_flow_cost(const Graph & g, Capacity capacity, ResidualCapacity residual_capacity, Weight weight)
