Merged from 1.33.0 release

[SVN r30540]

doc/BellmanFordVisitor.html

@@ -156,6 +156,7 @@ when there is a negative cycle in the graph.
   <li><a href="./bellman_visitor.html"><tt>bellman_visitor</tt></a>
 </ul>
 
+<a name="python"></a>
 <h3>Python</h3>
 
 To implement a model of the <tt>BellmanFordVisitor</tt> concept in Python,

doc/DFSVisitor.html

@@ -174,6 +174,7 @@ all the out-edges of <tt>u</tt> have been examined.
  <li><a href="./dfs_visitor.html"><tt>dfs_visitor</tt></a>
 </ul>
 
+<a name="python"></a>
 <h3>Python</h3>
 
 To implement a model of the <tt>DFSVisitor</tt> concept in Python,

doc/DijkstraVisitor.html

@@ -184,6 +184,7 @@ search tree and all of the adjacent vertices have been discovered
  <li><a href="./dijkstra_visitor.html"><tt>dijkstra_visitor</tt></a>
 </ul>
 
+<a name="python"></a>
 <h3>Python</h3>
 
 To implement a model of the <tt>DijkstraVisitor</tt> concept in Python,

doc/adjacency_iterator.html

@@ -35,7 +35,7 @@ namespace boost {
   template <class Graph, class VertexDescriptor, class OutEdgeIter>
   class adjacency_iterator_generator {
   public:
-    typedef <a href="../../utility/iterator_adaptors.htm#iterator_adaptor">iterator_adaptor</a>&lt;...&gt; type;
+    typedef <a href="../../iterator/doc/iterator_adaptor.html">iterator_adaptor</a>&lt;...&gt; type;
   };
 }
 </pre>

doc/breadth_first_search.html

@@ -242,7 +242,7 @@ UTIL: <tt>buffer(Buffer&amp; Q)</tt>
   <b>Default:</b> <tt>boost::queue</tt><br>
 
   <b>Python</b>: The buffer must derive from the <a
-  href="./Buffer.html#python">Buffer</a> type for the graph.
+  href="./Buffer.html">Buffer</a> type for the graph.
 
 </blockquote>  
 

doc/breadth_first_visit.html

@@ -113,7 +113,7 @@ UTIL: <tt>buffer(Buffer&amp; Q)</tt>
   <b>Default:</b> <tt>boost::queue</tt><br>
 
   <b>Python</b>: The buffer must derive from the <a
-  href="./Buffer.html#python">Buffer</a> type for the graph.
+  href="./Buffer.html">Buffer</a> type for the graph.
 </blockquote>  
 
 

doc/challenge.html

@@ -26,9 +26,9 @@
 <ul>
 
 <li>Dynamic graph algorithms such as described in <a
-href="http://citeseer.nj.nec.com/eppstein99dynamic.html">Dynamic Graph
+href="http://citeseer.ist.psu.edu/eppstein99dynamic.html">Dynamic Graph
 Algorithms</a> and <a
-href="http://citeseer.nj.nec.com/alberts98software.html">A Software
+href="http://citeseer.ist.psu.edu/alberts98software.html">A Software
 Library of Dynamic Graph Algorithms</a>.
 
 <li>Polish up code/docs for pending items and champion the formal

doc/cuthill_mckee_ordering.html

@@ -83,7 +83,7 @@ The goal of the Cuthill-Mckee (and reverse Cuthill-Mckee) ordering
 algorithm[<A
 HREF="bibliography.html#george81:__sparse_pos_def">14</A>, <A
 HREF="bibliography.html#cuthill69:reducing_bandwith">43</A>, <a
-href="bibliography.html#liu75:rcm">44</a>, <a
+href="bibliography.html#liu75:anal_cm_rcm">44</a>, <a
 href="bibliography.html#george71:fem">45</a> ] is to reduce the <a
 href="./bandwidth.html">bandwidth</a> of a graph by reordering the
 indices assigned to each vertex.  The Cuthill-Mckee ordering algorithm

doc/dag_shortest_paths.html

@@ -54,7 +54,7 @@ than either the Dijkstra or Bellman-Ford algorithm.
 Use breadth-first search instead of this algorithm
 when all edge weights are equal to one.  For the definition of the
 shortest-path problem see Section <A
-HREF="graph_theory_review.html#sec:shortest-path-algorithms">Shortest-Paths
+HREF="graph_theory_review.html#sec:shortest-paths-algorithms">Shortest-Paths
 Algorithms</A> for some background to the shortest-path problem.
 </P>
 

doc/depth_first_visit.html

@@ -27,12 +27,12 @@
 
 <P>
 <PRE>
-template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./DFSVisitor.html">DFSVisitor</a>, class <a href="#ColorMap">ColorMap</a>&gt;
+template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./DFSVisitor.html">DFSVisitor</a>, class ColorMap&gt;
 void depth_first_visit(IncidenceGraph& g,
   typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s, 
   DFSVisitor&amp; vis, ColorMap color)
 
-template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./DFSVisitor.html">DFSVisitor</a>, class <a href="#ColorMap">ColorMap</a>, 
+template &lt;class <a href="./IncidenceGraph.html">IncidenceGraph</a>, class <a href="./DFSVisitor.html">DFSVisitor</a>, class ColorMap, 
           class TerminatorFunc&gt;
 void depth_first_visit(IncidenceGraph& g,
   typename graph_traits&lt;IncidenceGraph&gt;::vertex_descriptor s, 

doc/dijkstra_shortest_paths.html

@@ -56,7 +56,7 @@ algorithm for the case when some edge weights are negative.  Use
 breadth-first search instead of Dijkstra's algorithm when all edge
 weights are equal to one.  For the definition of the shortest-path
 problem see Section <A
-HREF="graph_theory_review.html#sec:shortest-path-algorithms">Shortest-Paths
+HREF="graph_theory_review.html#sec:shortest-paths-algorithms">Shortest-Paths
 Algorithms</A> for some background to the shortest-path problem.
 </P>
 

doc/graph_theory_review.html

@@ -29,7 +29,7 @@ the reader has some previous acquaintance with graph algorithms, this
 chapter should be enough to get started.  If the reader has no
 previous background in graph algorithms we suggest a more thorough
 introduction such as <a
-href="http://www.toc.lcs.mit.edu/~clr/">Introduction to Algorithms</a>
+href="http://toc.lcs.mit.edu/~clr/">Introduction to Algorithms</a>
 by Cormen, Leiserson, and Rivest.
 
 <P>

doc/incremental_components.html

@@ -35,7 +35,7 @@ the situation where edges are both added and removed from the graph,
 hence it is called <b><i>incremental</i></b><a
 href="bibliography.html#eppstein97:dynamic_graph">[42]</a> (and not
 fully dynamic). The disjoint-sets class is described in Section <A
-HREF="../../disjoint_sets/disjoint_sets.html">Disjoint Sets</A>.
+HREF="../disjoint_sets/disjoint_sets.html">Disjoint Sets</A>.
 
 <P>
 The following five operations are the primary functions that you will

doc/inv_adjacency_iterator.html

@@ -37,7 +37,7 @@ namespace boost {
   template <class Graph, class VertexDescriptor, class InEdgeIter>
   class inv_adjacency_iterator_generator {
   public:
-    typedef <a href="../../utility/iterator_adaptors.htm#iterator_adaptor">iterator_adaptor</a>&lt;...&gt; type;
+    typedef <a href="../../iterator/doc/iterator_adaptor.html">iterator_adaptor</a>&lt;...&gt; type;
   };
 }
 </pre>

doc/kruskal_min_spanning_tree.html

@@ -95,7 +95,7 @@ IN: <tt>const Graph&amp; g</tt>
 IN: <tt>OutputIterator spanning_tree_edges</tt>
 <blockquote>
    The edges of the minimum spanning tree are output to this <a
-   href="http:www.sgi.com/tech/stl/OutputIterator.html">Output
+   href="http://www.sgi.com/tech/stl/OutputIterator.html">Output
    Iterator</a>.<br>
 
    <b>Python</b>: This parameter is not used in Python. Instead, a

doc/layout_tolerance.html

@@ -1,6 +1,6 @@
 <html><head><meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"><title>Struct template layout_tolerance</title></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><table cellpadding="2" width="100%"><td valign="top"><img src="../../../boost.png" alt="boost.png (6897 bytes)" width="277" height="86"></td><td align="center"><a href="../../../index.htm">Home</a></td><td align="center"><a href="../../libraries.htm">Libraries</a></td><td align="center"><a href="../../../people/people.htm">People</a></td><td align="center"><a href="../../../more/faq.htm">FAQ</a></td><td align="center"><a href="../../../more/index.htm">More</a></td></table><hr><div class="refentry" lang="en"><a name="struct.boost.layout_tolerance"></a><div class="titlepage"><div></div><div></div></div><div class="refnamediv"><h2><span class="refentrytitle">Struct template layout_tolerance</span></h2><p>boost::layout_tolerance &#8212; Determines when to terminate layout of a particular graph based on a given relative tolerance. </p></div><h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2><div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="bold"><b>template</b></span>&lt;<span class="bold"><b>typename</b></span> T = double&gt; 
 <span class="bold"><b>struct</b></span> layout_tolerance {
-  <span class="emphasis"><em>// <a href="layout_tolerance.html#struct.boost.layout_toleranceconstruct-copy-destruct">construct/copy/destruct</a></em></span>
+  <span class="emphasis"><em>// <a href="layout_tolerance.html#layout_toleranceconstruct-copy-destruct">construct/copy/destruct</a></em></span>
   <a href="layout_tolerance.html#id103752-bb">layout_tolerance</a>(<span class="bold"><b>const</b></span> T &amp; = T(0.001));
 
   <span class="emphasis"><em>// <a href="layout_tolerance.html#id103692-bb">public member functions</a></em></span>

doc/publications.html

@@ -26,8 +26,8 @@
 <li><a href="http://www.ddj.com/articles/2000/0009/0009toc.htm">Dr. Dobb's Sept. 2000 Article</a></a></li>
 <li><a href="http://www.acm.org/pubs/citations/proceedings/oops/320384/p399-siek/">OOPSLA'99 GGCL Paper</a></li>
 <li>Lie-Quan Lee's Master's Thesis about GGCL<a href="http://www.lsc.nd.edu/downloads/research/ggcl/papers/thesis.ps">(ps)</a> <a href="http://www.lsc.nd.edu/downloads/research/ggcl/papers/thesis.pdf">(pdf)</a></li>
-<li>Dietmar K&uuml;hl's Master's Thesis: <a href="ftp://ftp.informatik.uni-konstanz.de/pub/algo/personal/kuehl/da.ps.gz">Design Pattern for the Implementation of Graph Algorithms</a></li>
+<li><a href="http://www.dietmar-kuehl.de/generic-graph-algorithms.pdf">Dietmar K&uuml;hl's Master's Thesis: Design Pattern for the Implementation of Graph Algorithms</a></li>
-<li><a href="http://www.acl.lanl.gov/iscope99/">ISCOPE'99</a> Sparse Matrix Ordering <a href="./iscope99.pdf">(pdf)</a></li>
+<li>ISCOPE'99 Sparse Matrix Ordering <a href="./iscope99.pdf">(pdf)</a></li>
 <li><a href="http://www.oonumerics.org/tmpw00/">C++ Template Workshop 2000</a>, Concept Checking</li>
 </ul>
 

doc/sloan_start_end_vertices.htm

@@ -68,10 +68,10 @@ For version 1:
 See <A 
 href="http://www.boost.org/libs/graph/example/cuthill_mckee_ordering.cpp"><TT>example/sloan_ordering.cpp</TT></A>. 
 <H3>See Also</H3>
-<p><http://www.boost.org/libs/graph/doc/sloan_start_end_vertices.html><a href="http://www.boost.org/libs/graph/doc/sloan_start_end_vertices.html">sloan_start_end_vertices</a></http:>, 
+<p><a href="http://www.boost.org/libs/graph/doc/sloan_start_end_vertices.htm">sloan_start_end_vertices</a>, 
   <A 
-href="http://www.boost.org/libs/graph/doc/bandwidth.html">bandwidth</A>, <a href="http://www.boost.org/libs/graph/doc/profile.html">profile</a>, 
+href="http://www.boost.org/libs/graph/doc/bandwidth.html">bandwidth</A>, <a href="http://www.boost.org/libs/graph/doc/profile.htm">profile</a>, 
-  <a href="http://www.boost.org/libs/graph/doc/wavefront.html">wavefront</a> and 
+  <a href="http://www.boost.org/libs/graph/doc/wavefront.htm">wavefront</a> and 
   <TT>degree_property_map</TT> in <TT>boost/graph/properties.hpp</TT>. </p>
 <p>[1] S. W. Sloan, <i>An algorithm for profile and wavefront reduction of sparse 
   matrices</i>, Int. j. numer. methods eng., <b>23</b>, 239 - 251 (1986)</p>