diff --git a/doc/AdjacencyGraph.html b/doc/AdjacencyGraph.html index e644814b..317b34bb 100644 --- a/doc/AdjacencyGraph.html +++ b/doc/AdjacencyGraph.html @@ -161,7 +161,7 @@ experience with graph algorithm implementations.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/AdjacencyMatrix.html b/doc/AdjacencyMatrix.html index 22c4f17c..cb458547 100644 --- a/doc/AdjacencyMatrix.html +++ b/doc/AdjacencyMatrix.html @@ -96,7 +96,7 @@ The edge() function must return in constant time.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/BFSVisitor.html b/doc/BFSVisitor.html index 7f8de201..326d3654 100644 --- a/doc/BFSVisitor.html +++ b/doc/BFSVisitor.html @@ -207,10 +207,10 @@ class count_tree_edges_bfs_visitor(bgl.Graph.BFSVisitor):
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/BasicMatrix.html b/doc/BasicMatrix.html index 56d24991..986abaea 100644 --- a/doc/BasicMatrix.html +++ b/doc/BasicMatrix.html @@ -94,7 +94,7 @@ Element access is constant time.
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/BellmanFordVisitor.html b/doc/BellmanFordVisitor.html index 790624e0..40b2b425 100644 --- a/doc/BellmanFordVisitor.html +++ b/doc/BellmanFordVisitor.html @@ -171,10 +171,10 @@ class count_tree_edges_bellman_ford_visitor(bgl.Graph.BellmanFordVisitor):
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/BidirectionalGraph.html b/doc/BidirectionalGraph.html index 4aaf00b1..404b1c72 100644 --- a/doc/BidirectionalGraph.html +++ b/doc/BidirectionalGraph.html @@ -168,7 +168,7 @@ undirected graphs).
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/Buffer.html b/doc/Buffer.html index 2e3b0659..3a52b1b1 100644 --- a/doc/Buffer.html +++ b/doc/Buffer.html @@ -110,7 +110,7 @@ most linear time complexity in the size of the Generalized Queue.
Copyright © 2000-2001 -Jeremy Siek, Indiana University and C++ Library & Compiler Group/SGI (jsiek@engr.sgi.com) +Jeremy Siek, Indiana University and C++ Library & Compiler Group/SGI (jsiek@engr.sgi.com)
diff --git a/doc/ColorValue.html b/doc/ColorValue.html index 28b15e48..090d039e 100644 --- a/doc/ColorValue.html +++ b/doc/ColorValue.html @@ -95,10 +95,10 @@ href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructibl
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/DFSVisitor.html b/doc/DFSVisitor.html index 246303ac..1242f520 100644 --- a/doc/DFSVisitor.html +++ b/doc/DFSVisitor.html @@ -199,10 +199,10 @@ class count_tree_edges_dfs_visitor(bgl.Graph.DFSVisitor):
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/DijkstraVisitor.html b/doc/DijkstraVisitor.html index b8854c99..4b889b89 100644 --- a/doc/DijkstraVisitor.html +++ b/doc/DijkstraVisitor.html @@ -209,10 +209,10 @@ class count_tree_edges_dijkstra_visitor(bgl.Graph.DijkstraVisitor):
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/EdgeListGraph.html b/doc/EdgeListGraph.html index a4b7a2dd..f5d086ce 100644 --- a/doc/EdgeListGraph.html +++ b/doc/EdgeListGraph.html @@ -177,7 +177,7 @@ must all return in constant time.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/EdgeMutableGraph.html b/doc/EdgeMutableGraph.html index 0301eb29..07818d49 100644 --- a/doc/EdgeMutableGraph.html +++ b/doc/EdgeMutableGraph.html @@ -101,7 +101,7 @@ UNDER CONSTRUCTION
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/EventVisitor.html b/doc/EventVisitor.html index 358fc0a7..efb0c70c 100644 --- a/doc/EventVisitor.html +++ b/doc/EventVisitor.html @@ -148,10 +148,10 @@ either a vertex or edge descriptor of the graph.
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/EventVisitorList.html b/doc/EventVisitorList.html index b83eae1d..3cb03bd6 100644 --- a/doc/EventVisitorList.html +++ b/doc/EventVisitorList.html @@ -114,10 +114,10 @@ std::make_pair(visitor1,
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/Graph.html b/doc/Graph.html index 9a38fcd2..50812786 100644 --- a/doc/Graph.html +++ b/doc/Graph.html @@ -142,7 +142,7 @@ any vertex of graph object which type is G.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/IncidenceGraph.html b/doc/IncidenceGraph.html index efd49eab..a1ab72c8 100644 --- a/doc/IncidenceGraph.html +++ b/doc/IncidenceGraph.html @@ -189,10 +189,10 @@ Therefore, the extra requirement is added that the out-edge connecting
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/IteratorConstructibleGraph.html b/doc/IteratorConstructibleGraph.html index 1f71359e..55982585 100644 --- a/doc/IteratorConstructibleGraph.html +++ b/doc/IteratorConstructibleGraph.html @@ -148,10 +148,10 @@ constructor lacking the graph size information.
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/Monoid.html b/doc/Monoid.html index 37287c35..ba2366fb 100644 --- a/doc/Monoid.html +++ b/doc/Monoid.html @@ -109,10 +109,10 @@ Return type: bool
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/MutableGraph.html b/doc/MutableGraph.html index ae608838..b50890ca 100644 --- a/doc/MutableGraph.html +++ b/doc/MutableGraph.html @@ -292,7 +292,7 @@ is no longer a valid vertex descriptor.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/MutablePropertyGraph.html b/doc/MutablePropertyGraph.html index 31f3dbcd..15f17711 100644 --- a/doc/MutablePropertyGraph.html +++ b/doc/MutablePropertyGraph.html @@ -143,7 +143,7 @@ Return type: vertex_descriptor
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/PropertyGraph.html b/doc/PropertyGraph.html index f78ccade..2ed567b6 100644 --- a/doc/PropertyGraph.html +++ b/doc/PropertyGraph.html @@ -203,7 +203,7 @@ The get() property map function must be constant time.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/PropertyTag.html b/doc/PropertyTag.html index 8bc8a901..6b0c0267 100644 --- a/doc/PropertyTag.html +++ b/doc/PropertyTag.html @@ -110,7 +110,7 @@ type is also required to specialize
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/VertexAndEdgeListGraph.html b/doc/VertexAndEdgeListGraph.html index 785f78e0..50c6a134 100644 --- a/doc/VertexAndEdgeListGraph.html +++ b/doc/VertexAndEdgeListGraph.html @@ -63,7 +63,7 @@ requirements are added.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/VertexListGraph.html b/doc/VertexListGraph.html index 7de114b8..e49cdfca 100644 --- a/doc/VertexListGraph.html +++ b/doc/VertexListGraph.html @@ -147,7 +147,7 @@ groups these requirements together, hence the VertexListGraph concept.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/VertexMutableGraph.html b/doc/VertexMutableGraph.html index b73306f4..cec0a001 100644 --- a/doc/VertexMutableGraph.html +++ b/doc/VertexMutableGraph.html @@ -74,8 +74,8 @@ No additional associated types.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) -Lie-Quan Lee, Indiana University (llee@cs.indiana.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
diff --git a/doc/acknowledgements.html b/doc/acknowledgements.html index 09c30cfb..7c827689 100644 --- a/doc/acknowledgements.html +++ b/doc/acknowledgements.html @@ -63,10 +63,10 @@ Science of the U.S. Department of Energy.
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/adjacency_list.html b/doc/adjacency_list.html index f4e04811..ef626e33 100644 --- a/doc/adjacency_list.html +++ b/doc/adjacency_list.html @@ -1100,10 +1100,10 @@ Include boost/graph/ad
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/adjacency_list_traits.html b/doc/adjacency_list_traits.html index 793bcbae..6b38c3e0 100644 --- a/doc/adjacency_list_traits.html +++ b/doc/adjacency_list_traits.html @@ -145,10 +145,10 @@ parallel edges (disallow_parallel_edge_tag).
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/bandwidth.html b/doc/bandwidth.html index a9424645..53877877 100644 --- a/doc/bandwidth.html +++ b/doc/bandwidth.html @@ -86,7 +86,7 @@ of the i-th bandwidths Bi(G).
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/bc_clustering.html b/doc/bc_clustering.html index d7be582f..9fa60e50 100644 --- a/doc/bc_clustering.html +++ b/doc/bc_clustering.html @@ -140,7 +140,7 @@ IN: VertexIndexMap vertex_index -
Copyright © 2004Douglas Gregor, +Douglas Gregor, Indiana University (dgregor@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (examples/bellman-example.cpp.
Copyright © 2000 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/bellman_visitor.html b/doc/bellman_visitor.html index 0a5124f2..1259cd78 100644 --- a/doc/bellman_visitor.html +++ b/doc/bellman_visitor.html @@ -98,10 +98,10 @@ and property_writer.
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/betweenness_centrality.html b/doc/betweenness_centrality.html index e8eab286..47731524 100644 --- a/doc/betweenness_centrality.html +++ b/doc/betweenness_centrality.html @@ -296,7 +296,7 @@ is O(VE).
Copyright © 2004 -Douglas Gregor, Indiana University (dgregor@cs.indiana.edu)
+Douglas Gregor, Indiana University (dgregor@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/bfs_visitor.html b/doc/bfs_visitor.html index 608669b3..9bf31938 100644 --- a/doc/bfs_visitor.html +++ b/doc/bfs_visitor.html @@ -115,10 +115,10 @@ and property_writer.
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/bgl_named_params.html b/doc/bgl_named_params.html index 30eaebd0..2e9635b5 100644 --- a/doc/bgl_named_params.html +++ b/doc/bgl_named_params.html @@ -83,10 +83,10 @@ like boost::weight_map that create an instance of
Copyright © 2000-2001 -Jeremy Siek, +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/bibliography.html b/doc/bibliography.html index da96b674..19799338 100644 --- a/doc/bibliography.html +++ b/doc/bibliography.html @@ -439,7 +439,7 @@ Combinatorica 10: 41-51, 1990.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/biconnected_components.html b/doc/biconnected_components.html index 96457a62..3b1afa95 100644 --- a/doc/biconnected_components.html +++ b/doc/biconnected_components.html @@ -244,10 +244,10 @@ articulation points of an undirected graph.
Copyright © 2000-2004 -Jeremy Siek, Indiana +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
-Doug Gregor, Indiana University +Doug Gregor, Indiana University
diff --git a/doc/breadth_first_search.html b/doc/breadth_first_search.html index a7c8edab..169fc103 100644 --- a/doc/breadth_first_search.html +++ b/doc/breadth_first_search.html @@ -331,7 +331,7 @@ to listS.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/breadth_first_visit.html b/doc/breadth_first_visit.html index bd51793d..0747b426 100644 --- a/doc/breadth_first_visit.html +++ b/doc/breadth_first_visit.html @@ -182,7 +182,7 @@ The time complexity is O(E).
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/bundles.html b/doc/bundles.html index 08e46c89..bafbbdd5 100644 --- a/doc/bundles.html +++ b/doc/bundles.html @@ -168,7 +168,7 @@ dijkstra_shortest_paths(map, from, specialization.

-Copyright © 2004 Doug Gregor. +Copyright © 2004 Doug Gregor.
diff --git a/doc/challenge.html b/doc/challenge.html index 7a562285..2fa7740a 100644 --- a/doc/challenge.html +++ b/doc/challenge.html @@ -113,7 +113,7 @@ It is currently difficult to use from a C++ program.
Copyright © 2000-2001 -Jeremy Siek, Indiana University (jsiek@osl.iu.edu) +Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/circle_layout.html b/doc/circle_layout.html index 9e06dce1..0b1cb9bd 100644 --- a/doc/circle_layout.html +++ b/doc/circle_layout.html @@ -5,7 +5,7 @@ -- (See accompanying file LICENSE_1_0.txt or copy at -- http://www.boost.org/LICENSE_1_0.txt) --> -Function template circle_graph_layout
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore

(Python)Function template circle_graph_layout

boost::circle_graph_layout — Layout the graph with the vertices at the points of a regular n-polygon.

Synopsis

+Function template circle_graph_layout
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
(Python)Function template circle_graph_layout
boost::circle_graph_layout — Layout the graph with the vertices at the points of a regular n-polygon. 
Synopsis
 template<typename VertexListGraph, typename PositionMap, typename Radius> 
   void circle_graph_layout(const VertexListGraph & g, PositionMap position, 
                            Radius radius);
Where Defined
boost/graph/circle_layout.hpp
Description
The distance from the center of the polygon to each point is determined by the radius  parameter. The position  parameter must be an Lvalue Property Map whose value type is a class type containing x  and y  members that will be set to the x  and y  coordinates. 
@@ -44,7 +44,7 @@ IN: Radius radius
                            

 

 Copyright © 2004
-Douglas Gregor, Indiana University (dgregor -at- cs.indiana.edu)

+Douglas Gregor, Indiana University (dgregor -at- cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums -at- osl.iu.edu)
 

diff --git a/doc/compressed_sparse_row.html b/doc/compressed_sparse_row.html
index 9323a4db..9eedf0b3 100644
--- a/doc/compressed_sparse_row.html
+++ b/doc/compressed_sparse_row.html
@@ -711,7 +711,7 @@ BGL_FORALL_EDGES(e, g, WebGraph)
 

 

 Copyright © 2005
-Doug Gregor, Indiana University ()

+Doug Gregor, Indiana University ()

 Jeremiah Willcock, Indiana University ()

   Andrew Lumsdaine,
 Indiana University ()
diff --git a/doc/connected_components.html b/doc/connected_components.html
index c1811365..dcfbe8e2 100644
--- a/doc/connected_components.html
+++ b/doc/connected_components.html
@@ -150,7 +150,7 @@ undirected graph.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/constructing_algorithms.html b/doc/constructing_algorithms.html
index c04c8bda..14c33674 100644
--- a/doc/constructing_algorithms.html
+++ b/doc/constructing_algorithms.html
@@ -170,10 +170,10 @@ namespace boost {
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/copy_graph.html b/doc/copy_graph.html
index 368fc7e0..ab31940f 100644
--- a/doc/copy_graph.html
+++ b/doc/copy_graph.html
@@ -109,7 +109,7 @@ The time complexity is O(V + E).
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/cuthill_mckee_ordering.html b/doc/cuthill_mckee_ordering.html
index 1af288db..aa176270 100644
--- a/doc/cuthill_mckee_ordering.html
+++ b/doc/cuthill_mckee_ordering.html
@@ -240,7 +240,7 @@ and degree_property_map in boost/graph/properties.hpp.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/dag_shortest_paths.html b/doc/dag_shortest_paths.html
index ad6c675e..4768dc0c 100644
--- a/doc/dag_shortest_paths.html
+++ b/doc/dag_shortest_paths.html
@@ -318,7 +318,7 @@ algorithm.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/depth_first_search.html b/doc/depth_first_search.html
index 6bc6f110..ae52e253 100644
--- a/doc/depth_first_search.html
+++ b/doc/depth_first_search.html
@@ -301,10 +301,10 @@ The example in 
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/depth_first_visit.html b/doc/depth_first_visit.html
index 329d2cf2..7f1b704e 100644
--- a/doc/depth_first_visit.html
+++ b/doc/depth_first_visit.html
@@ -137,7 +137,7 @@ Time complexity is O(E).
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/dfs_visitor.html b/doc/dfs_visitor.html
index 6b79d823..035ff59d 100644
--- a/doc/dfs_visitor.html
+++ b/doc/dfs_visitor.html
@@ -98,10 +98,10 @@ and property_writer.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/dijkstra_shortest_paths.html b/doc/dijkstra_shortest_paths.html
index a7bdd166..7a439ae1 100644
--- a/doc/dijkstra_shortest_paths.html
+++ b/doc/dijkstra_shortest_paths.html
@@ -436,7 +436,7 @@ distance less than infinity.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/dijkstra_visitor.html b/doc/dijkstra_visitor.html
index 995030f8..c238053e 100644
--- a/doc/dijkstra_visitor.html
+++ b/doc/dijkstra_visitor.html
@@ -112,10 +112,10 @@ and property_writer.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/distance_recorder.html b/doc/distance_recorder.html
index eb1d137a..f4fe2baf 100644
--- a/doc/distance_recorder.html
+++ b/doc/distance_recorder.html
@@ -163,10 +163,10 @@ and property_writer.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/edge_list.html b/doc/edge_list.html
index 4a556cef..d00e12ba 100644
--- a/doc/edge_list.html
+++ b/doc/edge_list.html
@@ -208,10 +208,10 @@ Returns the target vertex of edge e.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/edmonds_karp_max_flow.html b/doc/edmonds_karp_max_flow.html
index d88adaca..f0178a8e 100644
--- a/doc/edmonds_karp_max_flow.html
+++ b/doc/edmonds_karp_max_flow.html
@@ -224,7 +224,7 @@ from a file in the DIMACS format and computes the maximum flow.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/erdos_renyi_generator.html b/doc/erdos_renyi_generator.html
index 1e17b7cd..4531437f 100644
--- a/doc/erdos_renyi_generator.html
+++ b/doc/erdos_renyi_generator.html
@@ -143,7 +143,7 @@ int main()
 

 

 Copyright © 2005
-Doug Gregor, Indiana University ()

+Doug Gregor, Indiana University ()

   Andrew Lumsdaine,
 Indiana University ()
 

diff --git a/doc/file_dependency_example.html b/doc/file_dependency_example.html
index 7aa0e68a..1b7ff931 100644
--- a/doc/file_dependency_example.html
+++ b/doc/file_dependency_example.html
@@ -356,7 +356,7 @@ dependency would be flagged as a user error.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/filtered_graph.html b/doc/filtered_graph.html
index 74bfcb7a..106ea617 100644
--- a/doc/filtered_graph.html
+++ b/doc/filtered_graph.html
@@ -522,10 +522,10 @@ num_edges(g))) which is assumed in many of the algorithms.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/fruchterman_reingold.html b/doc/fruchterman_reingold.html
index 2aa0a19a..89b58e62 100644
--- a/doc/fruchterman_reingold.html
+++ b/doc/fruchterman_reingold.html
@@ -234,7 +234,7 @@ determined by the cooling schedule.
 

 

 Copyright © 2004
-Doug Gregor, Indiana University
+Doug Gregor, Indiana University
 

 
 
diff --git a/doc/graph_coloring.html b/doc/graph_coloring.html
index e99470af..22ac4471 100644
--- a/doc/graph_coloring.html
+++ b/doc/graph_coloring.html
@@ -178,10 +178,10 @@ namespace boost {
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/graph_concepts.html b/doc/graph_concepts.html
index cb82769b..1291c10b 100644
--- a/doc/graph_concepts.html
+++ b/doc/graph_concepts.html
@@ -486,7 +486,7 @@ weight[(v,u)] = 3.1
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/graph_theory_review.html b/doc/graph_theory_review.html
index a541936d..4d5f64ea 100644
--- a/doc/graph_theory_review.html
+++ b/doc/graph_theory_review.html
@@ -583,7 +583,7 @@ which is based on the notion of a preflow introduced by
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/graph_traits.html b/doc/graph_traits.html
index 8831c34b..a5dc4ee6 100644
--- a/doc/graph_traits.html
+++ b/doc/graph_traits.html
@@ -239,10 +239,10 @@ of vertices in the graph.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/gursoy_atun_layout.html b/doc/gursoy_atun_layout.html
index 16bf2be8..1d8fc0c2 100644
--- a/doc/gursoy_atun_layout.html
+++ b/doc/gursoy_atun_layout.html
@@ -453,7 +453,7 @@ class heart_topology
 

 Copyright © 2004
 Jeremiah Willcock, Indiana University ()

-Doug Gregor, Indiana University ()

+Doug Gregor, Indiana University ()

   Andrew Lumsdaine,
 Indiana University ()
 

diff --git a/doc/history.html b/doc/history.html
index 6c9d4a7d..a7a8f5ea 100644
--- a/doc/history.html
+++ b/doc/history.html
@@ -189,10 +189,10 @@ September 27, 2000.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/incident.html b/doc/incident.html
index aefdfb88..68cf6c72 100644
--- a/doc/incident.html
+++ b/doc/incident.html
@@ -66,10 +66,10 @@ is the target. This function is equivalent to the expression
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/incremental_components.html b/doc/incremental_components.html
index 9ddb695b..7aed1a69 100644
--- a/doc/incremental_components.html
+++ b/doc/incremental_components.html
@@ -408,10 +408,10 @@ Returns the number of components in the graph.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/index.html b/doc/index.html
index 96028ecc..eae700d9 100644
--- a/doc/index.html
+++ b/doc/index.html
@@ -289,10 +289,10 @@ iterator and implements an Edge List Graph.
 
+"http://www.boost.org/people/people.htm">People
@@ -295,7 +295,7 @@ the WeightMap.

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/isomorphism.html b/doc/isomorphism.html
index 09d54f7d..a64391ab 100644
--- a/doc/isomorphism.html
+++ b/doc/isomorphism.html
@@ -193,7 +193,7 @@ See libs/graph/example/isomorphism.cpp<
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/johnson_all_pairs_shortest.html b/doc/johnson_all_pairs_shortest.html
index dbaa259b..4afc6dda 100644
--- a/doc/johnson_all_pairs_shortest.html
+++ b/doc/johnson_all_pairs_shortest.html
@@ -205,7 +205,7 @@ HREF="bibliography.html#clr90">8].
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/kamada_kawai_spring_layout.html b/doc/kamada_kawai_spring_layout.html
index ce2b26ad..5d46353e 100644
--- a/doc/kamada_kawai_spring_layout.html
+++ b/doc/kamada_kawai_spring_layout.html
@@ -23,7 +23,7 @@ alink="#0000FF">
 		Home
 Libraries
 People
 FAQ
 More
 

 

-

 

 Copyright © 2004Douglas Gregor,
+Douglas Gregor,
 Indiana University (dgregor -at cs.indiana.edu)

 Andrew Lumsdaine, Indiana
 University (
 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/king_ordering.html b/doc/king_ordering.html
index 9e425d5a..e4cfb0fb 100644
--- a/doc/king_ordering.html
+++ b/doc/king_ordering.html
@@ -228,7 +228,7 @@ and degree_property_map in boost/graph/properties.hpp.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/known_problems.html b/doc/known_problems.html
index e4add304..ae5e2fff 100644
--- a/doc/known_problems.html
+++ b/doc/known_problems.html
@@ -47,10 +47,10 @@
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/kruskal_min_spanning_tree.html b/doc/kruskal_min_spanning_tree.html
index 623dbf74..e6e210df 100644
--- a/doc/kruskal_min_spanning_tree.html
+++ b/doc/kruskal_min_spanning_tree.html
@@ -192,7 +192,7 @@ contains an example of using Kruskal's algorithm.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/layout_tolerance.html b/doc/layout_tolerance.html
index e242ce7b..b0d9f92d 100644
--- a/doc/layout_tolerance.html
+++ b/doc/layout_tolerance.html
@@ -5,7 +5,7 @@
   -- (See accompanying file LICENSE_1_0.txt or copy at
   -- http://www.boost.org/LICENSE_1_0.txt)
   -->
-Struct template layout_tolerance
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
Struct template layout_tolerance
boost::layout_tolerance — Determines when to terminate layout of a particular graph based on a given relative tolerance. 
Synopsis
template<typename T = double> 
+Struct template layout_tolerance
boost.png (6897 bytes)HomeLibrariesPeopleFAQMore
Struct template layout_tolerance
boost::layout_tolerance — Determines when to terminate layout of a particular graph based on a given relative tolerance. 
Synopsis
template<typename T = double> 
 struct layout_tolerance {
   // construct/copy/destruct
   layout_tolerance(const T & = T(0.001));
diff --git a/doc/leda_conversion.html b/doc/leda_conversion.html
index 035ecd8a..8844760d 100644
--- a/doc/leda_conversion.html
+++ b/doc/leda_conversion.html
@@ -250,10 +250,10 @@ href="../test/graph.cpp">test/graph.cpp.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/minimum_degree_ordering.html b/doc/minimum_degree_ordering.html
index 322a35e2..e85e70cd 100644
--- a/doc/minimum_degree_ordering.html
+++ b/doc/minimum_degree_ordering.html
@@ -170,8 +170,8 @@ elimination on row i of matrix A is equivalent to
 

 

 Copyright © 2001
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu) 

-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu) 

+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/null_visitor.html b/doc/null_visitor.html
index d5cb7520..e6842032 100644
--- a/doc/null_visitor.html
+++ b/doc/null_visitor.html
@@ -81,10 +81,10 @@ This does nothing.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/opposite.html b/doc/opposite.html
index 8af5ce56..252c47f3 100644
--- a/doc/opposite.html
+++ b/doc/opposite.html
@@ -66,10 +66,10 @@ assert(u == opposite(e, v, g));
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/plod_generator.html b/doc/plod_generator.html
index 5ee7ea8a..8e78ef3e 100644
--- a/doc/plod_generator.html
+++ b/doc/plod_generator.html
@@ -130,7 +130,7 @@ int main()
 

 

 Copyright © 2005
-Doug Gregor, Indiana University ()

+Doug Gregor, Indiana University ()

   Andrew Lumsdaine,
 Indiana University ()
 

diff --git a/doc/predecessor_recorder.html b/doc/predecessor_recorder.html
index 78ad4626..6f933b4f 100644
--- a/doc/predecessor_recorder.html
+++ b/doc/predecessor_recorder.html
@@ -173,10 +173,10 @@ and property_writer.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/prim_minimum_spanning_tree.html b/doc/prim_minimum_spanning_tree.html
index 3b6fa8bc..1f85695d 100644
--- a/doc/prim_minimum_spanning_tree.html
+++ b/doc/prim_minimum_spanning_tree.html
@@ -281,7 +281,7 @@ contains an example of using Prim's algorithm.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/property_map.html b/doc/property_map.html
index cf418402..b39c4ed3 100644
--- a/doc/property_map.html
+++ b/doc/property_map.html
@@ -73,10 +73,10 @@ href="../../property_map/property_map.html">property map.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/property_writer.html b/doc/property_writer.html
index 9372fded..c4d4155a 100644
--- a/doc/property_writer.html
+++ b/doc/property_writer.html
@@ -184,10 +184,10 @@ and time_stamper.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/publications.html b/doc/publications.html
index 535a32b9..fc919bcb 100644
--- a/doc/publications.html
+++ b/doc/publications.html
@@ -33,10 +33,10 @@
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/push_relabel_max_flow.html b/doc/push_relabel_max_flow.html
index 3142ad80..52d3061b 100644
--- a/doc/push_relabel_max_flow.html
+++ b/doc/push_relabel_max_flow.html
@@ -233,7 +233,7 @@ f 6 7 1
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/python.html b/doc/python.html
index 6e85e0b5..52ef6fcb 100644
--- a/doc/python.html
+++ b/doc/python.html
@@ -43,7 +43,7 @@
     

       

         Copyright © 2005
-          Doug Gregor, Indiana University ()

+          Doug Gregor, Indiana University ()

           Andrew Lumsdaine,
           Indiana University ()
     

diff --git a/doc/quick_tour.html b/doc/quick_tour.html
index 981b7b9e..0a959c00 100644
--- a/doc/quick_tour.html
+++ b/doc/quick_tour.html
@@ -594,7 +594,7 @@ is no long necessary, though this still makes for a good example.
 
-    

   

     Copyright © 2000Jeremy Siek,
+    Jeremy Siek,
       Indiana University (jsiek@osl.iu.edu)
   

 

diff --git a/doc/random_layout.html b/doc/random_layout.html
index a54e8929..c08f2959 100644
--- a/doc/random_layout.html
+++ b/doc/random_layout.html
@@ -94,7 +94,7 @@ concept.
 

 

 Copyright © 2004
-Doug Gregor, Indiana University
+Doug Gregor, Indiana University
 

 
 
diff --git a/doc/reverse_graph.html b/doc/reverse_graph.html
index caa6de62..24a867b5 100644
--- a/doc/reverse_graph.html
+++ b/doc/reverse_graph.html
@@ -408,9 +408,9 @@ href="../../../boost/pending/property.hpp">boost/pending/property.hpp
 

 Copyright © 2000-2001
-Dave Abrahams
+Dave Abrahams
 (david.abrahams@rcn.com)

-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

 

diff --git a/doc/sequential_vertex_coloring.html b/doc/sequential_vertex_coloring.html
index 0cd7ace4..504c8f39 100644
--- a/doc/sequential_vertex_coloring.html
+++ b/doc/sequential_vertex_coloring.html
@@ -110,7 +110,7 @@ in the graph, and k is the number of colors used.
 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)

-Douglas Gregor, Indiana University (dgregor -at- cs.indiana.edu))
+Douglas Gregor, Indiana University (dgregor -at- cs.indiana.edu))
 

   
 
diff --git a/doc/small_world_generator.html b/doc/small_world_generator.html
index 6151f6b6..2f44c06a 100644
--- a/doc/small_world_generator.html
+++ b/doc/small_world_generator.html
@@ -117,7 +117,7 @@ int main()
 

 

 Copyright © 2005
-Doug Gregor, Indiana University ()

+Doug Gregor, Indiana University ()

   Andrew Lumsdaine,
 Indiana University ()
 

diff --git a/doc/sorted_erdos_renyi_gen.html b/doc/sorted_erdos_renyi_gen.html
index 54e13a72..e03cbcf6 100644
--- a/doc/sorted_erdos_renyi_gen.html
+++ b/doc/sorted_erdos_renyi_gen.html
@@ -124,7 +124,7 @@ int main()
 		Copyright © 2005
 Jeremiah Willcock, Indiana University ()

   
-Doug Gregor, 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 a2bec08c..aed7d2d6 100644
--- a/doc/sparse_matrix_ordering.html
+++ b/doc/sparse_matrix_ordering.html
@@ -370,7 +370,7 @@ which is to extend partial PSAW in case by case and function
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/stanford_graph.html b/doc/stanford_graph.html
index d1d10922..f4aa4bee 100644
--- a/doc/stanford_graph.html
+++ b/doc/stanford_graph.html
@@ -443,10 +443,10 @@ class.

 Andreas Scherer,
 Aachen (andreas_freenet@freenet.de)

-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee,
+Lie-Quan Lee,
 Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
diff --git a/doc/strong_components.html b/doc/strong_components.html
index 491b62d8..8b6ebdcd 100644
--- a/doc/strong_components.html
+++ b/doc/strong_components.html
@@ -194,7 +194,7 @@ href="../example/strong_components.cpp">examples/strong_components.cpp<
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/table_of_contents.html b/doc/table_of_contents.html
index b537d799..a23e1f47 100644
--- a/doc/table_of_contents.html
+++ b/doc/table_of_contents.html
@@ -282,10 +282,10 @@
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/time_stamper.html b/doc/time_stamper.html
index daf7c1a7..08efa10d 100644
--- a/doc/time_stamper.html
+++ b/doc/time_stamper.html
@@ -183,10 +183,10 @@ and property_writer.
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/topological_sort.html b/doc/topological_sort.html
index e9751767..eae0400f 100644
--- a/doc/topological_sort.html
+++ b/doc/topological_sort.html
@@ -148,7 +148,7 @@ The output is:
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/transitive_closure.html b/doc/transitive_closure.html
index c3f9ce14..ba596f25 100644
--- a/doc/transitive_closure.html
+++ b/doc/transitive_closure.html
@@ -216,7 +216,7 @@ component of u to any of the vertices in the component of
 

 

 Copyright © 2001
-Jeremy Siek, Indiana Univ.(jsiek@cs.indiana.edu)
+Jeremy Siek, Indiana Univ.(jsiek@cs.indiana.edu)
 

 
 
diff --git a/doc/transpose_graph.html b/doc/transpose_graph.html
index 726a6946..bae82f47 100644
--- a/doc/transpose_graph.html
+++ b/doc/transpose_graph.html
@@ -120,7 +120,7 @@ The time complexity is O(V + E).
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/trouble_shooting.html b/doc/trouble_shooting.html
index aec8ad06..c14e8b67 100644
--- a/doc/trouble_shooting.html
+++ b/doc/trouble_shooting.html
@@ -115,10 +115,10 @@ for (std::size_t j = 0; j < n_edges; ++j)
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/undirected_dfs.html b/doc/undirected_dfs.html
index 5ce3a136..53bd726b 100644
--- a/doc/undirected_dfs.html
+++ b/doc/undirected_dfs.html
@@ -323,10 +323,10 @@ An example is in 
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/using_adjacency_list.html b/doc/using_adjacency_list.html
index bcd498d6..ba8867e0 100644
--- a/doc/using_adjacency_list.html
+++ b/doc/using_adjacency_list.html
@@ -781,7 +781,7 @@ href="http://www.sgi.com/tech/stl/AssociativeContainer.html">AssociativeContaine
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/using_property_maps.html b/doc/using_property_maps.html
index 8429cde4..412b5fe5 100644
--- a/doc/using_property_maps.html
+++ b/doc/using_property_maps.html
@@ -473,7 +473,7 @@ previous section.
 

 

 Copyright © 2000-2001
-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
 

 
 
diff --git a/doc/visitor_concepts.html b/doc/visitor_concepts.html
index 7189c0c5..da86e1dc 100644
--- a/doc/visitor_concepts.html
+++ b/doc/visitor_concepts.html
@@ -48,10 +48,10 @@ the following visitor concepts:
 

 

 Copyright © 2000-2001
-Jeremy Siek,
+Jeremy Siek,
 Indiana University (jsiek@osl.iu.edu)

-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

 Andrew Lumsdaine,
 Indiana University (lums@osl.iu.edu)
diff --git a/doc/write-graphviz.html b/doc/write-graphviz.html
index 778963ab..188c5edf 100644
--- a/doc/write-graphviz.html
+++ b/doc/write-graphviz.html
@@ -338,8 +338,8 @@ without the library libbglviz.a.
 

 

 Copyright © 2000-2001
-Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

-Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
+Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)

+Jeremy Siek, Indiana University (jsiek@osl.iu.edu)