diff --git a/doc/AStarHeuristic.html b/doc/AStarHeuristic.html index d57ed61b..5d0c1aeb 100644 --- a/doc/AStarHeuristic.html +++ b/doc/AStarHeuristic.html @@ -128,7 +128,7 @@ Called for the target of every out edge of a vertex being examined.
-
Copyright © 2004 +Copyright © 2004 Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu) diff --git a/doc/AStarVisitor.html b/doc/AStarVisitor.html index 1ffad8d2..da99a8ed 100644 --- a/doc/AStarVisitor.html +++ b/doc/AStarVisitor.html @@ -203,7 +203,7 @@ happens after all of its out edges have been examined.
-
Copyright © 2004 +Copyright © 2004 Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu) diff --git a/doc/AdjacencyGraph.html b/doc/AdjacencyGraph.html index 3278d533..0764b29b 100644 --- a/doc/AdjacencyGraph.html +++ b/doc/AdjacencyGraph.html @@ -160,7 +160,7 @@ experience with graph algorithm implementations.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/AdjacencyMatrix.html b/doc/AdjacencyMatrix.html index 1ddf78ab..e3c18250 100644 --- a/doc/AdjacencyMatrix.html +++ b/doc/AdjacencyMatrix.html @@ -95,7 +95,7 @@ The edge() function must return in constant time.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/BFSVisitor.html b/doc/BFSVisitor.html index 259aaf88..2390a294 100644 --- a/doc/BFSVisitor.html +++ b/doc/BFSVisitor.html @@ -206,7 +206,7 @@ class count_tree_edges_bfs_visitor(bgl.Graph.BFSVisitor):
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/BasicMatrix.html b/doc/BasicMatrix.html index d3a7e03d..00ba171e 100644 --- a/doc/BasicMatrix.html +++ b/doc/BasicMatrix.html @@ -93,7 +93,7 @@ Element access is constant time.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu) diff --git a/doc/BellmanFordVisitor.html b/doc/BellmanFordVisitor.html index 0c74d7cd..96462288 100644 --- a/doc/BellmanFordVisitor.html +++ b/doc/BellmanFordVisitor.html @@ -170,7 +170,7 @@ class count_tree_edges_bellman_ford_visitor(bgl.Graph.BellmanFordVisitor):
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/BidirectionalGraph.html b/doc/BidirectionalGraph.html index d4732d1a..f67a92a4 100644 --- a/doc/BidirectionalGraph.html +++ b/doc/BidirectionalGraph.html @@ -167,7 +167,7 @@ undirected graphs).
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/Buffer.html b/doc/Buffer.html index 19aaac3c..b3243dea 100644 --- a/doc/Buffer.html +++ b/doc/Buffer.html @@ -109,7 +109,7 @@ most linear time complexity in the size of the Generalized Queue.
-
Copyright © 2000-2001 +Copyright © 2000-2001 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 ef862934..101dde3c 100644 --- a/doc/ColorValue.html +++ b/doc/ColorValue.html @@ -94,7 +94,7 @@ href="http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructibl
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/DFSVisitor.html b/doc/DFSVisitor.html index c7d3e94e..7ba1c342 100644 --- a/doc/DFSVisitor.html +++ b/doc/DFSVisitor.html @@ -198,7 +198,7 @@ class count_tree_edges_dfs_visitor(bgl.Graph.DFSVisitor):
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/DijkstraVisitor.html b/doc/DijkstraVisitor.html index 80782228..e8c8c6c9 100644 --- a/doc/DijkstraVisitor.html +++ b/doc/DijkstraVisitor.html @@ -208,7 +208,7 @@ class count_tree_edges_dijkstra_visitor(bgl.Graph.DijkstraVisitor):
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/EdgeListGraph.html b/doc/EdgeListGraph.html index e7838893..cb87cdb0 100644 --- a/doc/EdgeListGraph.html +++ b/doc/EdgeListGraph.html @@ -176,7 +176,7 @@ must all return in constant time.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/EdgeMutableGraph.html b/doc/EdgeMutableGraph.html index 03e614ed..8429f0c5 100644 --- a/doc/EdgeMutableGraph.html +++ b/doc/EdgeMutableGraph.html @@ -100,7 +100,7 @@ UNDER CONSTRUCTION
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/EventVisitor.html b/doc/EventVisitor.html index 6fb03739..bba55b9f 100644 --- a/doc/EventVisitor.html +++ b/doc/EventVisitor.html @@ -147,7 +147,7 @@ either a vertex or edge descriptor of the graph.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/EventVisitorList.html b/doc/EventVisitorList.html index 65546f97..c4dd24f7 100644 --- a/doc/EventVisitorList.html +++ b/doc/EventVisitorList.html @@ -113,7 +113,7 @@ std::make_pair(visitor1,
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/Graph.html b/doc/Graph.html index 4af74631..2c74f367 100644 --- a/doc/Graph.html +++ b/doc/Graph.html @@ -141,7 +141,7 @@ any vertex of graph object which type is G.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/IncidenceGraph.html b/doc/IncidenceGraph.html index 4b21e271..cbdc60b1 100644 --- a/doc/IncidenceGraph.html +++ b/doc/IncidenceGraph.html @@ -188,7 +188,7 @@ Therefore, the extra requirement is added that the out-edge connecting
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/IteratorConstructibleGraph.html b/doc/IteratorConstructibleGraph.html index a7977bef..9ac6fe46 100644 --- a/doc/IteratorConstructibleGraph.html +++ b/doc/IteratorConstructibleGraph.html @@ -147,7 +147,7 @@ constructor lacking the graph size information.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/Monoid.html b/doc/Monoid.html index b9ab7a46..c38e3009 100644 --- a/doc/Monoid.html +++ b/doc/Monoid.html @@ -108,7 +108,7 @@ Return type: bool
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/MutableGraph.html b/doc/MutableGraph.html index b5cd35da..edc4e64a 100644 --- a/doc/MutableGraph.html +++ b/doc/MutableGraph.html @@ -291,7 +291,7 @@ is no longer a valid vertex descriptor.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/MutablePropertyGraph.html b/doc/MutablePropertyGraph.html index dde8b968..8275bbbc 100644 --- a/doc/MutablePropertyGraph.html +++ b/doc/MutablePropertyGraph.html @@ -142,7 +142,7 @@ Return type: vertex_descriptor
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/PlanarFaceVisitor.html b/doc/PlanarFaceVisitor.html index ee140ea4..a6c25c6f 100644 --- a/doc/PlanarFaceVisitor.html +++ b/doc/PlanarFaceVisitor.html @@ -142,7 +142,7 @@ a model of Planar Face Visitor.
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/PropertyGraph.html b/doc/PropertyGraph.html index 0308103b..ab9fa416 100644 --- a/doc/PropertyGraph.html +++ b/doc/PropertyGraph.html @@ -202,7 +202,7 @@ The get() property map function must be constant time.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/PropertyTag.html b/doc/PropertyTag.html index 0dc7d023..455ea231 100644 --- a/doc/PropertyTag.html +++ b/doc/PropertyTag.html @@ -109,7 +109,7 @@ type is also required to specialize
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/TSPTourVisitor.html b/doc/TSPTourVisitor.html index bf6ca0e2..42d6e3b2 100644 --- a/doc/TSPTourVisitor.html +++ b/doc/TSPTourVisitor.html @@ -92,7 +92,7 @@ This is invoked on each vertex of the graph when it is visited as part of the TS
-
Copyright © 2008 +Copyright © 2008 Matyas Egyhazy
diff --git a/doc/VertexAndEdgeListGraph.html b/doc/VertexAndEdgeListGraph.html index bde47f84..5aabebda 100644 --- a/doc/VertexAndEdgeListGraph.html +++ b/doc/VertexAndEdgeListGraph.html @@ -62,7 +62,7 @@ requirements are added.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/VertexListGraph.html b/doc/VertexListGraph.html index f508efb8..ee546fea 100644 --- a/doc/VertexListGraph.html +++ b/doc/VertexListGraph.html @@ -146,7 +146,7 @@ groups these requirements together, hence the VertexListGraph concept.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/VertexMutableGraph.html b/doc/VertexMutableGraph.html index 5609439d..043b4f09 100644 --- a/doc/VertexMutableGraph.html +++ b/doc/VertexMutableGraph.html @@ -73,7 +73,7 @@ No additional associated types.
-
Copyright © 2000-2001 +Copyright © 2000-2001 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 670766e7..de6a8d38 100644 --- a/doc/acknowledgements.html +++ b/doc/acknowledgements.html @@ -62,7 +62,7 @@ Science of the U.S. Department of Energy.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/adjacency_list.html b/doc/adjacency_list.html index 03c1e353..be600274 100644 --- a/doc/adjacency_list.html +++ b/doc/adjacency_list.html @@ -1120,7 +1120,7 @@ Include boost/graph/ad
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/adjacency_list_traits.html b/doc/adjacency_list_traits.html index 8680084e..d37a9698 100644 --- a/doc/adjacency_list_traits.html +++ b/doc/adjacency_list_traits.html @@ -144,7 +144,7 @@ parallel edges (disallow_parallel_edge_tag).
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/astar_heuristic.html b/doc/astar_heuristic.html index ea648842..5c215d6d 100644 --- a/doc/astar_heuristic.html +++ b/doc/astar_heuristic.html @@ -86,7 +86,7 @@ to a goal.
-
Copyright © 2004 +Copyright © 2004 Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu) diff --git a/doc/astar_search.html b/doc/astar_search.html index 8f9dc2fa..d81680da 100644 --- a/doc/astar_search.html +++ b/doc/astar_search.html @@ -489,7 +489,7 @@ this state by pointer or reference.
-
Copyright © 2004 +Copyright © 2004 Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu) diff --git a/doc/astar_visitor.html b/doc/astar_visitor.html index bfcb350d..2a94e837 100644 --- a/doc/astar_visitor.html +++ b/doc/astar_visitor.html @@ -98,7 +98,7 @@ and property_writer.
-
Copyright © 2004 +Copyright © 2004 Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu) diff --git a/doc/bandwidth.html b/doc/bandwidth.html index 1d88befa..b02f770d 100644 --- a/doc/bandwidth.html +++ b/doc/bandwidth.html @@ -85,7 +85,7 @@ of the i-th bandwidths Bi(G).
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/bellman_visitor.html b/doc/bellman_visitor.html index 77d439df..bd6eb9b5 100644 --- a/doc/bellman_visitor.html +++ b/doc/bellman_visitor.html @@ -97,7 +97,7 @@ and property_writer.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/betweenness_centrality.html b/doc/betweenness_centrality.html index b18997cc..9b1a27d0 100644 --- a/doc/betweenness_centrality.html +++ b/doc/betweenness_centrality.html @@ -295,7 +295,7 @@ is O(VE). -
Copyright © 2004 +Copyright © 2004 Douglas Gregor, Indiana University (dgregor@cs.indiana.edu)
Andrew Lumsdaine, Indiana University (property_writer.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/bgl_named_params.html b/doc/bgl_named_params.html index 98449486..8258024a 100644 --- a/doc/bgl_named_params.html +++ b/doc/bgl_named_params.html @@ -82,7 +82,7 @@ like boost::weight_map that create an instance of
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/bibliography.html b/doc/bibliography.html index 437540df..fb3bbb25 100644 --- a/doc/bibliography.html +++ b/doc/bibliography.html @@ -438,7 +438,7 @@ Combinatorica 10: 41-51, 1990.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/biconnected_components.html b/doc/biconnected_components.html index 50612ecb..4af85e15 100644 --- a/doc/biconnected_components.html +++ b/doc/biconnected_components.html @@ -243,7 +243,7 @@ articulation points of an undirected graph.
-
Copyright © 2000-2004 +Copyright © 2000-2004 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/boyer_myrvold.html b/doc/boyer_myrvold.html index 9a63f29c..a2792a30 100644 --- a/doc/boyer_myrvold.html +++ b/doc/boyer_myrvold.html @@ -253,7 +253,7 @@ graph to boyer_myrvold_planarity_test.
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/breadth_first_search.html b/doc/breadth_first_search.html index 990f475a..4bf2f23e 100644 --- a/doc/breadth_first_search.html +++ b/doc/breadth_first_search.html @@ -330,7 +330,7 @@ to listS.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/breadth_first_visit.html b/doc/breadth_first_visit.html index 11009d20..96bfc3a3 100644 --- a/doc/breadth_first_visit.html +++ b/doc/breadth_first_visit.html @@ -178,7 +178,7 @@ The time complexity is O(E).
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/challenge.html b/doc/challenge.html index b17b1bc4..ee72397a 100644 --- a/doc/challenge.html +++ b/doc/challenge.html @@ -112,7 +112,7 @@ It is currently difficult to use from a C++ program.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/circle_layout.html b/doc/circle_layout.html index c51aeb61..26b66102 100644 --- a/doc/circle_layout.html +++ b/doc/circle_layout.html @@ -43,7 +43,7 @@ IN: Radius radius -
Copyright © 2004 +Copyright © 2004 Douglas Gregor, Indiana University (dgregor -at- cs.indiana.edu)
Andrew Lumsdaine, Indiana University (lums -at- osl.iu.edu) diff --git a/doc/connected_components.html b/doc/connected_components.html index e0975cd3..6dd3df94 100644 --- a/doc/connected_components.html +++ b/doc/connected_components.html @@ -149,7 +149,7 @@ undirected graph.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/constructing_algorithms.html b/doc/constructing_algorithms.html index 82bd2d47..0067ee3e 100644 --- a/doc/constructing_algorithms.html +++ b/doc/constructing_algorithms.html @@ -169,7 +169,7 @@ namespace boost {
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/copy_graph.html b/doc/copy_graph.html index 93e56478..833370b1 100644 --- a/doc/copy_graph.html +++ b/doc/copy_graph.html @@ -108,7 +108,7 @@ The time complexity is O(V + E).
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/cuthill_mckee_ordering.html b/doc/cuthill_mckee_ordering.html index f51771ad..a390cfdc 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 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/dag_shortest_paths.html b/doc/dag_shortest_paths.html index 89cdff46..a88e99ba 100644 --- a/doc/dag_shortest_paths.html +++ b/doc/dag_shortest_paths.html @@ -317,7 +317,7 @@ algorithm.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/depth_first_search.html b/doc/depth_first_search.html index aacc2e7d..c598c5f9 100644 --- a/doc/depth_first_search.html +++ b/doc/depth_first_search.html @@ -300,7 +300,7 @@ The example in
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/depth_first_visit.html b/doc/depth_first_visit.html index 597f5fc5..95514e08 100644 --- a/doc/depth_first_visit.html +++ b/doc/depth_first_visit.html @@ -136,7 +136,7 @@ Time complexity is O(E).
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/dfs_visitor.html b/doc/dfs_visitor.html index f2d0dc34..9c3fb1a2 100644 --- a/doc/dfs_visitor.html +++ b/doc/dfs_visitor.html @@ -97,7 +97,7 @@ and property_writer.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/dijkstra_shortest_paths.html b/doc/dijkstra_shortest_paths.html index 2d10220b..ac991c79 100644 --- a/doc/dijkstra_shortest_paths.html +++ b/doc/dijkstra_shortest_paths.html @@ -450,7 +450,7 @@ distance less than infinity.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/dijkstra_shortest_paths_no_color_map.html b/doc/dijkstra_shortest_paths_no_color_map.html index 097f204b..c08cc57e 100644 --- a/doc/dijkstra_shortest_paths_no_color_map.html +++ b/doc/dijkstra_shortest_paths_no_color_map.html @@ -391,7 +391,7 @@ distance less than infinity.
-
Copyright © 2009 +Copyright © 2009 Trustees of Indiana University
diff --git a/doc/dijkstra_visitor.html b/doc/dijkstra_visitor.html index a7afd34b..80b00af9 100644 --- a/doc/dijkstra_visitor.html +++ b/doc/dijkstra_visitor.html @@ -111,7 +111,7 @@ and property_writer.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/distance_recorder.html b/doc/distance_recorder.html index 235b3445..e10e3f57 100644 --- a/doc/distance_recorder.html +++ b/doc/distance_recorder.html @@ -162,7 +162,7 @@ and property_writer.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/edge_list.html b/doc/edge_list.html index 94b85e65..39d75942 100644 --- a/doc/edge_list.html +++ b/doc/edge_list.html @@ -207,7 +207,7 @@ Returns the target vertex of edge e.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/edmonds_karp_max_flow.html b/doc/edmonds_karp_max_flow.html index 7d8a28f8..4747c6c6 100644 --- a/doc/edmonds_karp_max_flow.html +++ b/doc/edmonds_karp_max_flow.html @@ -223,7 +223,7 @@ from a file in the DIMACS format and computes the maximum flow.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/erdos_renyi_generator.html b/doc/erdos_renyi_generator.html index 9c842deb..b5adaaf7 100644 --- a/doc/erdos_renyi_generator.html +++ b/doc/erdos_renyi_generator.html @@ -142,7 +142,7 @@ int main()
-
Copyright © 2005 +Copyright © 2005 Doug Gregor, Indiana University ()
Andrew Lumsdaine, Indiana University () diff --git a/doc/file_dependency_example.html b/doc/file_dependency_example.html index 39b1a8e8..c600b74c 100644 --- a/doc/file_dependency_example.html +++ b/doc/file_dependency_example.html @@ -355,7 +355,7 @@ dependency would be flagged as a user error.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/filtered_graph.html b/doc/filtered_graph.html index a72e531b..8f5d1c39 100644 --- a/doc/filtered_graph.html +++ b/doc/filtered_graph.html @@ -521,7 +521,7 @@ num_edges(g))) which is assumed in many of the algorithms.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/floyd_warshall_shortest.html b/doc/floyd_warshall_shortest.html index b7ca894f..ab407a6c 100644 --- a/doc/floyd_warshall_shortest.html +++ b/doc/floyd_warshall_shortest.html @@ -157,7 +157,7 @@ The time complexity is O(V3).
-
Copyright © 2002-2004 +Copyright © 2002-2004 Lauren Foutz, Rensselaer Polytechnic Institute
Scott Hill, Rensselaer Polytechnic Institute diff --git a/doc/fruchterman_reingold.html b/doc/fruchterman_reingold.html index d08fab05..ed854a9f 100644 --- a/doc/fruchterman_reingold.html +++ b/doc/fruchterman_reingold.html @@ -233,7 +233,7 @@ determined by the cooling schedule.
-
Copyright © 2004 +Copyright © 2004 Doug Gregor, Indiana University
diff --git a/doc/graph_coloring.html b/doc/graph_coloring.html index cc632590..cfeaaef9 100644 --- a/doc/graph_coloring.html +++ b/doc/graph_coloring.html @@ -177,7 +177,7 @@ namespace boost {
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/graph_concepts.html b/doc/graph_concepts.html index d2b949bc..5d251b5e 100644 --- a/doc/graph_concepts.html +++ b/doc/graph_concepts.html @@ -485,7 +485,7 @@ weight[(v,u)] = 3.1
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/graph_theory_review.html b/doc/graph_theory_review.html index ae80c8b3..8d79b2d3 100644 --- a/doc/graph_theory_review.html +++ b/doc/graph_theory_review.html @@ -582,7 +582,7 @@ which is based on the notion of a preflow introduced by
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/graph_traits.html b/doc/graph_traits.html index f31652e0..96f443ee 100644 --- a/doc/graph_traits.html +++ b/doc/graph_traits.html @@ -238,7 +238,7 @@ of vertices in the graph.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/history.html b/doc/history.html index 2d014b5a..5c210a25 100644 --- a/doc/history.html +++ b/doc/history.html @@ -194,7 +194,7 @@ September 27, 2000.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/incident.html b/doc/incident.html index f339c4c0..e75f336c 100644 --- a/doc/incident.html +++ b/doc/incident.html @@ -65,7 +65,7 @@ is the target. This function is equivalent to the expression
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/incremental_components.html b/doc/incremental_components.html index 7580279a..3812eab8 100644 --- a/doc/incremental_components.html +++ b/doc/incremental_components.html @@ -407,7 +407,7 @@ Returns the number of components in the graph.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/index.html b/doc/index.html index 09b9e3ae..19e313c8 100644 --- a/doc/index.html +++ b/doc/index.html @@ -288,7 +288,7 @@ iterator and implements an Edge List Graph.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/is_straight_line_drawing.html b/doc/is_straight_line_drawing.html index 1f7cca0a..8e8321b1 100644 --- a/doc/is_straight_line_drawing.html +++ b/doc/is_straight_line_drawing.html @@ -88,6 +88,6 @@ A Readable Property Ma
-Copyright © 2007 Aaron Windsor (aaron.windsor@gmail.com) +Copyright © 2007 Aaron Windsor (aaron.windsor@gmail.com) diff --git a/doc/isomorphism.html b/doc/isomorphism.html index 7a8a3d81..2738280a 100644 --- a/doc/isomorphism.html +++ b/doc/isomorphism.html @@ -192,7 +192,7 @@ See libs/graph/example/isomorphism.cpp<
-
Copyright © 2000-2001 +Copyright © 2000-2001 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 d41e6b81..8e95b05a 100644 --- a/doc/johnson_all_pairs_shortest.html +++ b/doc/johnson_all_pairs_shortest.html @@ -204,7 +204,7 @@ HREF="bibliography.html#clr90">8].
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/known_problems.html b/doc/known_problems.html index a67753e9..a7856623 100644 --- a/doc/known_problems.html +++ b/doc/known_problems.html @@ -56,7 +56,7 @@ define the BOOST_NO_HASH prior to including any Boost.Graph headers
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/kruskal_min_spanning_tree.html b/doc/kruskal_min_spanning_tree.html index 7b7277d4..69d2a2a9 100644 --- a/doc/kruskal_min_spanning_tree.html +++ b/doc/kruskal_min_spanning_tree.html @@ -191,7 +191,7 @@ contains an example of using Kruskal's algorithm.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/leda_conversion.html b/doc/leda_conversion.html index 7c0ed884..a8ba39f3 100644 --- a/doc/leda_conversion.html +++ b/doc/leda_conversion.html @@ -249,7 +249,7 @@ href="../test/graph.cpp">test/graph.cpp.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/make_biconnected_planar.html b/doc/make_biconnected_planar.html index 53c4ff82..99195555 100644 --- a/doc/make_biconnected_planar.html +++ b/doc/make_biconnected_planar.html @@ -111,7 +111,7 @@ runs in time O(n)
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/make_connected.html b/doc/make_connected.html index d757ca02..24d6f524 100644 --- a/doc/make_connected.html +++ b/doc/make_connected.html @@ -110,7 +110,7 @@ runs in time O(n + m)
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/make_maximal_planar.html b/doc/make_maximal_planar.html index 944e3b56..523ce721 100644 --- a/doc/make_maximal_planar.html +++ b/doc/make_maximal_planar.html @@ -122,7 +122,7 @@ On a graph with n vertices and m edges,
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/metric_tsp_approx.html b/doc/metric_tsp_approx.html index ad6b9b4d..b475c9d3 100644 --- a/doc/metric_tsp_approx.html +++ b/doc/metric_tsp_approx.html @@ -196,7 +196,7 @@ contains an example of using this TSP approximation algorithm.
-
Copyright © 2008 +Copyright © 2008 Matyas Egyhazy
diff --git a/doc/minimum_degree_ordering.html b/doc/minimum_degree_ordering.html index 4b92662d..13282cd4 100644 --- a/doc/minimum_degree_ordering.html +++ b/doc/minimum_degree_ordering.html @@ -169,7 +169,7 @@ elimination on row i of matrix A is equivalent to
-
Copyright © 2001 +Copyright © 2001 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 a9958d8f..902c05d3 100644 --- a/doc/null_visitor.html +++ b/doc/null_visitor.html @@ -80,7 +80,7 @@ This does nothing.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/opposite.html b/doc/opposite.html index ad77b5f5..6e3f12db 100644 --- a/doc/opposite.html +++ b/doc/opposite.html @@ -65,7 +65,7 @@ assert(u == opposite(e, v, g));
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/planar_face_traversal.html b/doc/planar_face_traversal.html index 684e30d8..c52fa8b8 100644 --- a/doc/planar_face_traversal.html +++ b/doc/planar_face_traversal.html @@ -196,7 +196,7 @@ A Readable Property Ma
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/planar_graphs.html b/doc/planar_graphs.html index db56c0e3..ad6914b2 100644 --- a/doc/planar_graphs.html +++ b/doc/planar_graphs.html @@ -270,7 +270,7 @@ a cycle of any length is an expansion of a triangle.
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/plod_generator.html b/doc/plod_generator.html index 58462cf8..5c21f1a3 100644 --- a/doc/plod_generator.html +++ b/doc/plod_generator.html @@ -129,7 +129,7 @@ int main()
-
Copyright © 2005 +Copyright © 2005 Doug Gregor, Indiana University ()
Andrew Lumsdaine, Indiana University () diff --git a/doc/predecessor_recorder.html b/doc/predecessor_recorder.html index 74ac53b5..ab1d4d47 100644 --- a/doc/predecessor_recorder.html +++ b/doc/predecessor_recorder.html @@ -172,7 +172,7 @@ and property_writer.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/prim_minimum_spanning_tree.html b/doc/prim_minimum_spanning_tree.html index e6be7b2e..5db9439c 100644 --- a/doc/prim_minimum_spanning_tree.html +++ b/doc/prim_minimum_spanning_tree.html @@ -280,7 +280,7 @@ contains an example of using Prim's algorithm.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/property_map.html b/doc/property_map.html index 80571e77..35eb476e 100644 --- a/doc/property_map.html +++ b/doc/property_map.html @@ -72,7 +72,7 @@ href="../../property_map/doc/property_map.html">property map.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/property_writer.html b/doc/property_writer.html index 33c36ae5..8ce39189 100644 --- a/doc/property_writer.html +++ b/doc/property_writer.html @@ -183,7 +183,7 @@ and time_stamper.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/publications.html b/doc/publications.html index 3520b179..20415342 100644 --- a/doc/publications.html +++ b/doc/publications.html @@ -32,7 +32,7 @@
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/push_relabel_max_flow.html b/doc/push_relabel_max_flow.html index 3a53b482..45dc6db8 100644 --- a/doc/push_relabel_max_flow.html +++ b/doc/push_relabel_max_flow.html @@ -232,7 +232,7 @@ f 6 7 1
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/r_c_shortest_paths.html b/doc/r_c_shortest_paths.html index f17c744f..cc5fd260 100755 --- a/doc/r_c_shortest_paths.html +++ b/doc/r_c_shortest_paths.html @@ -563,7 +563,7 @@ It is obvious that one would not use the algorithm for SPPs without resource con +nowrap>Copyright © 2006
Copyright © 2006 Michael Drexl (michaeldrexl at web dot de)
diff --git a/doc/reverse_graph.html b/doc/reverse_graph.html index d23f63d5..96d03537 100644 --- a/doc/reverse_graph.html +++ b/doc/reverse_graph.html @@ -407,7 +407,7 @@ href="../../../boost/pending/property.hpp">boost/pending/property.hpp -
Copyright © 2000-2001 +Copyright © 2000-2001 Dave Abrahams (david.abrahams@rcn.com)
Jeremy Siek, diff --git a/doc/sequential_vertex_coloring.html b/doc/sequential_vertex_coloring.html index e0298627..30239261 100644 --- a/doc/sequential_vertex_coloring.html +++ b/doc/sequential_vertex_coloring.html @@ -106,7 +106,7 @@ in the graph, and k is the number of colors used. -
Copyright © 1997-2004 +Copyright © 1997-2004 Andrew Lumsdaine, Indiana University (lums@osl.iu.edu)
diff --git a/doc/small_world_generator.html b/doc/small_world_generator.html index af845e8a..0b853502 100644 --- a/doc/small_world_generator.html +++ b/doc/small_world_generator.html @@ -116,7 +116,7 @@ int main()
-
Copyright © 2005 +Copyright © 2005 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 d44a225a..55273fa2 100644 --- a/doc/sorted_erdos_renyi_gen.html +++ b/doc/sorted_erdos_renyi_gen.html @@ -121,7 +121,7 @@ int main()
-
Copyright © 2005 +Copyright © 2005 Jeremiah Willcock, Indiana University ()
Doug Gregor, Indiana University ()
diff --git a/doc/sparse_matrix_ordering.html b/doc/sparse_matrix_ordering.html index 35b4ced9..87b39e7f 100644 --- a/doc/sparse_matrix_ordering.html +++ b/doc/sparse_matrix_ordering.html @@ -369,7 +369,7 @@ which is to extend partial PSAW in case by case and function
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/stanford_graph.html b/doc/stanford_graph.html index b6ea21f9..f418deca 100644 --- a/doc/stanford_graph.html +++ b/doc/stanford_graph.html @@ -439,7 +439,7 @@ class.

-
Copyright © 2001 +Copyright © 2001 Andreas Scherer, Aachen (andreas_freenet@freenet.de)
diff --git a/doc/straight_line_drawing.html b/doc/straight_line_drawing.html index a00d35e8..d54e6e71 100644 --- a/doc/straight_line_drawing.html +++ b/doc/straight_line_drawing.html @@ -148,7 +148,7 @@ A Readable Property Ma
-Copyright © 2007 Aaron Windsor ( +Copyright © 2007 Aaron Windsor ( aaron.windsor@gmail.com) diff --git a/doc/strong_components.html b/doc/strong_components.html index dada464b..64451c34 100644 --- a/doc/strong_components.html +++ b/doc/strong_components.html @@ -193,7 +193,7 @@ href="../example/strong_components.cpp">examples/strong_components.cpp<
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/table_of_contents.html b/doc/table_of_contents.html index 2e2c9fff..c395f897 100644 --- a/doc/table_of_contents.html +++ b/doc/table_of_contents.html @@ -291,7 +291,7 @@
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/time_stamper.html b/doc/time_stamper.html index 338719fc..6689af28 100644 --- a/doc/time_stamper.html +++ b/doc/time_stamper.html @@ -182,7 +182,7 @@ and property_writer.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/topological_sort.html b/doc/topological_sort.html index 7ec5b145..0f72470f 100644 --- a/doc/topological_sort.html +++ b/doc/topological_sort.html @@ -148,7 +148,7 @@ The output is:
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/transitive_closure.html b/doc/transitive_closure.html index 809913a9..e8793304 100644 --- a/doc/transitive_closure.html +++ b/doc/transitive_closure.html @@ -215,7 +215,7 @@ component of u to any of the vertices in the component of
-
Copyright © 2001 +Copyright © 2001 Jeremy Siek, Indiana Univ.(jsiek@cs.indiana.edu)
diff --git a/doc/transpose_graph.html b/doc/transpose_graph.html index 908d8409..7c7057f3 100644 --- a/doc/transpose_graph.html +++ b/doc/transpose_graph.html @@ -119,7 +119,7 @@ The time complexity is O(V + E).
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/trouble_shooting.html b/doc/trouble_shooting.html index 367fe638..5aca7fa9 100644 --- a/doc/trouble_shooting.html +++ b/doc/trouble_shooting.html @@ -115,7 +115,7 @@ for (std::size_t j = 0; j < n_edges; ++j)
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/tsp_tour_len_visitor.html b/doc/tsp_tour_len_visitor.html index 389156a1..8136ad14 100644 --- a/doc/tsp_tour_len_visitor.html +++ b/doc/tsp_tour_len_visitor.html @@ -115,7 +115,7 @@ None
-
Copyright © 2008 +Copyright © 2008 Matyas Egyhazy
diff --git a/doc/tsp_tour_visitor.html b/doc/tsp_tour_visitor.html index dc34393a..c993d3a6 100644 --- a/doc/tsp_tour_visitor.html +++ b/doc/tsp_tour_visitor.html @@ -88,7 +88,7 @@ None
-
Copyright © 2008 +Copyright © 2008 Matyas Egyhazy
diff --git a/doc/undirected_dfs.html b/doc/undirected_dfs.html index 9ac0bc4f..ffbefa28 100644 --- a/doc/undirected_dfs.html +++ b/doc/undirected_dfs.html @@ -322,7 +322,7 @@ An example is in
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/using_adjacency_list.html b/doc/using_adjacency_list.html index c1662fea..03206ecc 100644 --- a/doc/using_adjacency_list.html +++ b/doc/using_adjacency_list.html @@ -779,7 +779,7 @@ href="http://www.sgi.com/tech/stl/AssociativeContainer.html">AssociativeContaine
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/using_property_maps.html b/doc/using_property_maps.html index 5a83f555..451e858e 100644 --- a/doc/using_property_maps.html +++ b/doc/using_property_maps.html @@ -472,7 +472,7 @@ previous section.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/visitor_concepts.html b/doc/visitor_concepts.html index cb102f5e..4053282b 100644 --- a/doc/visitor_concepts.html +++ b/doc/visitor_concepts.html @@ -47,7 +47,7 @@ the following visitor concepts:
-
Copyright © 2000-2001 +Copyright © 2000-2001 Jeremy Siek, Indiana University (jsiek@osl.iu.edu)
diff --git a/doc/write-graphviz.html b/doc/write-graphviz.html index db6d0eae..5fb58b4f 100644 --- a/doc/write-graphviz.html +++ b/doc/write-graphviz.html @@ -337,7 +337,7 @@ without the library libbglviz.a.
-
Copyright © 2000-2001 +Copyright © 2000-2001 Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
Jeremy Siek, Indiana University (jsiek@osl.iu.edu)