[DEV] add v1.76.0

libs/graph/doc/constructing_algorithms.html

@@ -1,17 +1,17 @@
 <HTML>
 <!--
      Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
-    
+
      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)
   -->
 <Head>
 <Title>Boost Graph Library: Constructing Graph Algorithms</Title>
-<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" 
-        ALINK="#ff0000"> 
-<IMG SRC="../../../boost.png" 
-     ALT="C++ Boost" width="277" height="86"> 
+<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
+        ALINK="#ff0000">
+<IMG SRC="../../../boost.png"
+     ALT="C++ Boost" width="277" height="86">
 
 <BR Clear>
 
@@ -113,7 +113,7 @@ color of all the vertices to "uncolored."
 namespace boost {
   template &lt;class VertexListGraph, class Order, class Color&gt;
   typename graph_traits&lt;VertexListGraph&gt;::vertices_size_type
-  sequential_vertex_color_ting(const VertexListGraph&amp; G, 
+  sequential_vertex_color_ting(const VertexListGraph&amp; G,
     Order order, Color color)
   {
     typedef graph_traits&lt;VertexListGraph&gt; GraphTraits;
@@ -127,27 +127,27 @@ namespace boost {
     BOOST_CONCEPT_ASSERT(( IntegerConcept&lt;ColorType&gt; ));
     BOOST_CONCEPT_ASSERT(( ReadablePropertyMapConcept&lt;Order, size_type&gt; ));
     BOOST_STATIC_ASSERT((is_same&lt;OrderType, vertex_descriptor&gt;::value));
-    
+
     size_type max_color = 0;
     const size_type V = num_vertices(G);
-    std::vector&lt;size_type&gt; 
+    std::vector&lt;size_type&gt;
       mark(V, numeric_limits_max(max_color));
-    
+
     typename GraphTraits::vertex_iterator v, vend;
     for (boost::tie(v, vend) = vertices(G); v != vend; ++v)
       color[*v] = V - 1; // which means "not colored"
-    
+
     for (size_type i = 0; i &lt; V; i++) {
       vertex_descriptor current = order[i];
 
       // mark all the colors of the adjacent vertices
       typename GraphTraits::adjacency_iterator ai, aend;
       for (boost::tie(ai, aend) = adjacent_vertices(current, G); ai != aend; ++ai)
-        mark[color[*ai]] = i; 
+        mark[color[*ai]] = i;
 
       // find the smallest color unused by the adjacent vertices
       size_type smallest_color = 0;
-      while (smallest_color &lt; max_color &amp;&amp; mark[smallest_color] == i) 
+      while (smallest_color &lt; max_color &amp;&amp; mark[smallest_color] == i)
         ++smallest_color;
 
       // if all the colors are used up, increase the number of colors
@@ -174,10 +174,10 @@ namespace boost {
 Indiana University (<A
 HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br>
 <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br>
-<A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>,
+<A HREF="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine</A>,
 Indiana University (<A
 HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>)
 </TD></TR></TABLE>
 
 </BODY>
-</HTML> 
+</HTML>