Subject: [Boost-commit] svn:boost r59133 - trunk/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2010-01-18 13:31:14
Author: jewillco
Date: 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
New Revision: 59133
URL: http://svn.boost.org/trac/boost/changeset/59133
Log:
Fixed bookmark errors
Text files modified:
trunk/libs/graph/doc/adjacency_list.html | 4 ++--
trunk/libs/graph/doc/adjacency_matrix.html | 4 ++--
trunk/libs/graph/doc/biconnected_components.html | 9 +++++++++
trunk/libs/graph/doc/compressed_sparse_row.html | 18 +++++++++++-------
trunk/libs/graph/doc/graph_theory_review.html | 4 ++--
trunk/libs/graph/doc/history.html | 2 +-
trunk/libs/graph/doc/maximum_matching.html | 6 +++---
trunk/libs/graph/doc/planar_graphs.html | 2 +-
8 files changed, 31 insertions(+), 18 deletions(-)
Modified: trunk/libs/graph/doc/adjacency_list.html
==============================================================================
--- trunk/libs/graph/doc/adjacency_list.html (original)
+++ trunk/libs/graph/doc/adjacency_list.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -37,7 +37,7 @@
representation of a directed graph.
<P></P>
-<DIV ALIGN="center"><A NAME="fig:adj-list-graph"></A><A NAME="1509"></A>
+<DIV ALIGN="center"><A NAME="fig:adj-list-graph"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG> Adjacency List Representation of a Directed Graph.</CAPTION>
<TR><TD><IMG SRC="./figs/adj-matrix-graph2.gif" width="386" height="284"></TD>
@@ -67,7 +67,7 @@
representation of an undirected graph.
<P></P>
-<DIV ALIGN="center"><A NAME="fig:undir-adj-list-graph"></A><A NAME="1509"></A>
+<DIV ALIGN="center"><A NAME="fig:undir-adj-list-graph"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 2:</STRONG> Adjacency List Representation of an Undirected Graph.</CAPTION>
<TR><TD><IMG SRC="./figs/undir-adj-matrix-graph2.gif" width="260" height="240"></TD>
Modified: trunk/libs/graph/doc/adjacency_matrix.html
==============================================================================
--- trunk/libs/graph/doc/adjacency_matrix.html (original)
+++ trunk/libs/graph/doc/adjacency_matrix.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -32,7 +32,7 @@
representation of a graph.
<P></P>
-<DIV ALIGN="center"><A NAME="fig:adj-matrix-graph"></A><A NAME="1509"></A>
+<DIV ALIGN="center"><A NAME="fig:adj-matrix-graph"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG> Adjacency Matrix Representation of a Directed Graph.</CAPTION>
<TR><TD><IMG SRC="./figs/adj-matrix-graph3.gif" width="386" height="284"></TD>
@@ -72,7 +72,7 @@
matrix representation of an undirected graph.
<P></P>
-<DIV ALIGN="center"><A NAME="fig:undir-adj-matrix-graph"></A><A NAME="1509"></A>
+<DIV ALIGN="center"><A NAME="fig:undir-adj-matrix-graph"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG> Adjacency Matrix Representation of an Undirected Graph.</CAPTION>
<TR><TD><IMG SRC="./figs/undir-adj-matrix-graph3.gif" width="260" height="240"></TD>
Modified: trunk/libs/graph/doc/biconnected_components.html
==============================================================================
--- trunk/libs/graph/doc/biconnected_components.html (original)
+++ trunk/libs/graph/doc/biconnected_components.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -239,6 +239,15 @@
contains an example of calculating the biconnected components and
articulation points of an undirected graph.
+<h3>Notes</h3>
+
+<p><a name="1">[1]</a>
+ 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.
+
<br>
<HR>
<TABLE>
Modified: trunk/libs/graph/doc/compressed_sparse_row.html
==============================================================================
--- trunk/libs/graph/doc/compressed_sparse_row.html (original)
+++ trunk/libs/graph/doc/compressed_sparse_row.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -224,7 +224,7 @@
edges_size_type num_edges(const compressed_sparse_row_graph&);
<i>// Vertex access</i>
-vertex_descriptor vertex(vertices_size_type i, const compressed_sparse_row_graph&);
+vertex_descriptor vertex(vertices_size_type i, const compressed_sparse_row_graph&);
<i>// Edge access</i>
std::pair<edge_descriptor, bool>
@@ -460,7 +460,7 @@
<hr></hr>
- <pre><a name="edge-const"></a>
+ <pre><a name="edge-multi-const"></a>
template<typename MultiPassInputIterator>
compressed_sparse_row_graph(edges_are_unsorted_multi_pass_t,
MultiPassInputIterator edge_begin, MultiPassInputIterator edge_end,
@@ -489,7 +489,7 @@
<hr></hr>
- <pre><a name="edge-prop-const"></a>
+ <pre><a name="edge-multi-prop-const"></a>
template<typename MultiPassInputIterator, typename EdgePropertyIterator>
compressed_sparse_row_graph(edges_are_unsorted_multi_pass_t,
MultiPassInputIterator edge_begin, MultiPassInputIterator edge_end,
@@ -624,7 +624,7 @@
<hr></hr>
- <pre><a name="#graph-const"></a>
+ <pre><a name="graph-const"></a>
template<typename Graph, typename VertexIndexMap>
compressed_sparse_row_graph(const Graph& g, const VertexIndexMap& vi,
vertices_size_type numverts,
@@ -713,7 +713,7 @@
<a name="vertex-access"></a><h3>Vertex access</h3>
- <pre><a name="vertex"></a>
+ <pre><a name="vertex-lookup"></a>
vertex_descriptor vertex(vertices_size_type i, const compressed_sparse_row_graph&);
</pre>
<p class="indent">
@@ -723,6 +723,8 @@
<hr></hr>
+ <a name="edge-access"></a><h3>Edge access</h3>
+
<pre><a name="edge"></a>
std::pair<edge_descriptor, bool>
edge(vertex_descriptor u, vertex_descriptor v, const compressed_sparse_row_graph&);
@@ -733,8 +735,10 @@
descriptor for that edge and <tt>true</tt>; otherwise, the
second value in the pair will be <tt>false</tt>. If multiple
edges exist from <tt>u</tt> to <tt>v</tt>, the first edge will
- be returned; use edge_range
- to retrieve all edges. This function requires linear time in the
+ be returned; use out_edges and a
+ conditional statement
+ to retrieve all edges to a given target. This function requires linear
+ time in the
number of edges outgoing from <tt>u</tt>.
</p>
Modified: trunk/libs/graph/doc/graph_theory_review.html
==============================================================================
--- trunk/libs/graph/doc/graph_theory_review.html (original)
+++ trunk/libs/graph/doc/graph_theory_review.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -90,7 +90,7 @@
<P>
<P></P>
-<DIV ALIGN="center"><A NAME="fig:directed-graph"></A><A NAME="1509"></A>
+<DIV ALIGN="center"><A NAME="fig:directed-graph"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 1:</STRONG>
Example of a directed graph.</CAPTION>
@@ -558,7 +558,7 @@
vertex.
<P></P>
-<DIV ALIGN="center"><A NAME="fig:max-flow"></A><A NAME="1509"></A>
+<DIV ALIGN="center"><A NAME="fig:max-flow"></A>
<TABLE>
<CAPTION ALIGN="BOTTOM"><STRONG>Figure 8:</STRONG> A Maximum Flow
Network.<br> Edges are labeled with the flow and capacity
Modified: trunk/libs/graph/doc/history.html
==============================================================================
--- trunk/libs/graph/doc/history.html (original)
+++ trunk/libs/graph/doc/history.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -76,7 +76,7 @@
<h2>Changes by version</h2>
<a name="by-version">
<ul>
- <a name="1.35.0"></a><li>Version 1.35.0<br><b>New algorithms and components</b>
+ <a name="1.36.0"></a><li>Version 1.36.0<br><b>New algorithms and components</b>
<ul>
<li>r_c_shortest_paths, resource-constrained shortest paths, from Michael Drexl.</li>
</ul>
Modified: trunk/libs/graph/doc/maximum_matching.html
==============================================================================
--- trunk/libs/graph/doc/maximum_matching.html (original)
+++ trunk/libs/graph/doc/maximum_matching.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -27,7 +27,7 @@
bool checked_edmonds_maximum_cardinality_matching(const Graph& g, MateMap mate, VertexIndexMap vm);
</pre>
<p>
-<a name="sec:articulation_points">A <i>matching</i> is a subset of the edges
+<a name="sec:matching">A <i>matching</i> is a subset of the edges
of a graph such that no two edges share a common vertex.
Two different matchings in the same graph are illustrated below (edges in the
matching are colored blue.) The matching on the left is a <i>maximal matching</i>,
@@ -38,9 +38,9 @@
</a></p><p></p><center>
<table border="0">
<tr>
-<td><a name="sec:articulation_points"><img src="figs/maximal-match.png"></a></td>
+<td><a name="fig:maximal_matching"><img src="figs/maximal-match.png"></a></td>
<td width="150"></td>
-<td><a name="sec:articulation_points"><img src="figs/maximum-match.png"></a></td>
+<td><a name="fig:maximum_matching"><img src="figs/maximum-match.png"></a></td>
</tr>
</table>
</center>
Modified: trunk/libs/graph/doc/planar_graphs.html
==============================================================================
--- trunk/libs/graph/doc/planar_graphs.html (original)
+++ trunk/libs/graph/doc/planar_graphs.html 2010-01-18 13:31:13 EST (Mon, 18 Jan 2010)
@@ -88,7 +88,7 @@
the (unbounded) region outside the triangle. The unbounded region outside the
graph's embedding is called the <i>outer face</i>. Every embedding yields
one outer face and zero or more inner faces. A famous result called
-<a name="EulersFormula">Euler's formula</a> states that for any
+Euler's formula states that for any
planar graph with <i>n</i> vertices, <i>e</i> edges, <i>f</i> faces, and
<i>c</i> connected components,
<a name="EulersFormula">