diff --git a/doc/AStarHeuristic.html b/doc/AStarHeuristic.html index 8d2515f1..dbe2132d 100644 --- a/doc/AStarHeuristic.html +++ b/doc/AStarHeuristic.html @@ -129,7 +129,7 @@ Called for the target of every out edge of a vertex being examined.
Copyright © 2004 -Kristopher Beevers, +Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu)
diff --git a/doc/AStarVisitor.html b/doc/AStarVisitor.html index af2022e1..ba4ac92e 100644 --- a/doc/AStarVisitor.html +++ b/doc/AStarVisitor.html @@ -204,7 +204,7 @@ happens after all of its out-edges have been examined.
Copyright © 2004 -Kristopher Beevers, +Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu)
diff --git a/doc/BFSVisitor.html b/doc/BFSVisitor.html index 5333a9df..1effc11c 100644 --- a/doc/BFSVisitor.html +++ b/doc/BFSVisitor.html @@ -211,7 +211,7 @@ class count_tree_edges_bfs_visitor(bgl.Graph.BFSVisitor): Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/BellmanFordVisitor.html b/doc/BellmanFordVisitor.html index 4bfbdfd9..30a896b1 100644 --- a/doc/BellmanFordVisitor.html +++ b/doc/BellmanFordVisitor.html @@ -175,7 +175,7 @@ class count_tree_edges_bellman_ford_visitor(bgl.Graph.BellmanFordVisitor): Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/ColorValue.html b/doc/ColorValue.html index 7f639b33..48c985dc 100644 --- a/doc/ColorValue.html +++ b/doc/ColorValue.html @@ -99,7 +99,7 @@ href="http://www.boost.org/sgi/stl/DefaultConstructible.html">DefaultConstructib Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/DFSVisitor.html b/doc/DFSVisitor.html index a018257b..fb0bed6d 100644 --- a/doc/DFSVisitor.html +++ b/doc/DFSVisitor.html @@ -212,7 +212,7 @@ class count_tree_edges_dfs_visitor(bgl.Graph.DFSVisitor): Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/DijkstraVisitor.html b/doc/DijkstraVisitor.html index 1f25bc84..43e82803 100644 --- a/doc/DijkstraVisitor.html +++ b/doc/DijkstraVisitor.html @@ -213,7 +213,7 @@ class count_tree_edges_dijkstra_visitor(bgl.Graph.DijkstraVisitor): Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/EventVisitor.html b/doc/EventVisitor.html index bba55b9f..c81ed921 100644 --- a/doc/EventVisitor.html +++ b/doc/EventVisitor.html @@ -152,7 +152,7 @@ either a vertex or edge descriptor of the graph. Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/EventVisitorList.html b/doc/EventVisitorList.html index 09e8e9cc..2892f824 100644 --- a/doc/EventVisitorList.html +++ b/doc/EventVisitorList.html @@ -118,7 +118,7 @@ std::make_pair(visitor1, Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/IncidenceGraph.html b/doc/IncidenceGraph.html index 228cbfc8..ad125b4d 100644 --- a/doc/IncidenceGraph.html +++ b/doc/IncidenceGraph.html @@ -193,7 +193,7 @@ Therefore, the extra requirement is added that the out-edge connecting Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/IteratorConstructibleGraph.html b/doc/IteratorConstructibleGraph.html index 83aa007c..b168ae8c 100644 --- a/doc/IteratorConstructibleGraph.html +++ b/doc/IteratorConstructibleGraph.html @@ -152,7 +152,7 @@ constructor lacking the graph size information. Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/Monoid.html b/doc/Monoid.html index 05714bb2..fb32470c 100644 --- a/doc/Monoid.html +++ b/doc/Monoid.html @@ -113,7 +113,7 @@ Return type: bool Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/acknowledgements.html b/doc/acknowledgements.html index de6a8d38..0131c894 100644 --- a/doc/acknowledgements.html +++ b/doc/acknowledgements.html @@ -67,7 +67,7 @@ Science of the U.S. Department of Energy. Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/adjacency_list.html b/doc/adjacency_list.html index a7528802..f572257e 100644 --- a/doc/adjacency_list.html +++ b/doc/adjacency_list.html @@ -1127,7 +1127,7 @@ Include boost/graph/ad Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/adjacency_list_traits.html b/doc/adjacency_list_traits.html index a3ad0128..72574c34 100644 --- a/doc/adjacency_list_traits.html +++ b/doc/adjacency_list_traits.html @@ -149,7 +149,7 @@ parallel edges (disallow_parallel_edge_tag). Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/astar_heuristic.html b/doc/astar_heuristic.html index 5c215d6d..fd032bd5 100644 --- a/doc/astar_heuristic.html +++ b/doc/astar_heuristic.html @@ -87,7 +87,7 @@ to a goal.
Copyright © 2004 -Kristopher Beevers, +Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu)
diff --git a/doc/astar_search.html b/doc/astar_search.html index 18a70926..6d629164 100644 --- a/doc/astar_search.html +++ b/doc/astar_search.html @@ -580,7 +580,7 @@ this state by pointer or reference.
Copyright © 2004 -Kristopher Beevers, +Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu)
diff --git a/doc/astar_visitor.html b/doc/astar_visitor.html index 2a94e837..d2229a95 100644 --- a/doc/astar_visitor.html +++ b/doc/astar_visitor.html @@ -99,7 +99,7 @@ and property_writer.
Copyright © 2004 -Kristopher Beevers, +Kristopher Beevers, Rensselaer Polytechnic Institute (beevek@cs.rpi.edu)
diff --git a/doc/bc_clustering.html b/doc/bc_clustering.html index 9ff3dca6..8df4c4fa 100644 --- a/doc/bc_clustering.html +++ b/doc/bc_clustering.html @@ -142,7 +142,7 @@ IN: VertexIndexMap vertex_index Copyright © 2004 Douglas Gregor, Indiana University (dgregor@cs.indiana.edu)
-Andrew Lumsdaine, Indiana +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/bellman_visitor.html b/doc/bellman_visitor.html index 72dae162..6fea8425 100644 --- a/doc/bellman_visitor.html +++ b/doc/bellman_visitor.html @@ -102,7 +102,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/betweenness_centrality.html b/doc/betweenness_centrality.html index 488f0778..efa1095e 100644 --- a/doc/betweenness_centrality.html +++ b/doc/betweenness_centrality.html @@ -297,7 +297,7 @@ is O(VE). Copyright © 2004 Douglas Gregor, Indiana University (dgregor@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/bfs_visitor.html b/doc/bfs_visitor.html index b175ac96..db168c71 100644 --- a/doc/bfs_visitor.html +++ b/doc/bfs_visitor.html @@ -119,7 +119,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/bgl_named_params.html b/doc/bgl_named_params.html index 8258024a..58d8459b 100644 --- a/doc/bgl_named_params.html +++ b/doc/bgl_named_params.html @@ -87,7 +87,7 @@ like boost::weight_map that create an instance of Indiana University (jsiek@osl.iu.edu)
Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
-Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/challenge.html b/doc/challenge.html index ee72397a..072ba134 100644 --- a/doc/challenge.html +++ b/doc/challenge.html @@ -61,12 +61,12 @@ polygons.
  • Rewrite the Qhull algorithm using the Boost Graph Library (this is high difficulty challenge). Or, for a more manageable challenge, write an interface for Qhull with the BGL. Qhull computes the +href="http://www.qhull.org/">Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, and halfspace intersection about a point. Qhull runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull is used for collision detection, animation, plate tectonics, 3-d modeling, robot motion planning, and other applications. +href="http://www.qhull.org/news/qhull-news.html#users">applications. It is currently difficult to use from a C++ program.
    • diff --git a/doc/circle_layout.html b/doc/circle_layout.html index 26b66102..e1b53935 100644 --- a/doc/circle_layout.html +++ b/doc/circle_layout.html @@ -45,7 +45,7 @@ IN: Radius radius Copyright © 2004 Douglas Gregor, Indiana University (dgregor -at- cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums -at- osl.iu.edu) diff --git a/doc/compressed_sparse_row.html b/doc/compressed_sparse_row.html index ccfdf3df..9519f9b0 100644 --- a/doc/compressed_sparse_row.html +++ b/doc/compressed_sparse_row.html @@ -964,7 +964,7 @@ BGL_FORALL_EDGES(e, g, WebGraph) Copyright © 2005 Doug Gregor, Indiana University ()
    Jeremiah Willcock, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University () diff --git a/doc/constructing_algorithms.html b/doc/constructing_algorithms.html index 4c9e96e2..a7b7f4ca 100644 --- a/doc/constructing_algorithms.html +++ b/doc/constructing_algorithms.html @@ -174,7 +174,7 @@ namespace boost { Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/depth_first_search.html b/doc/depth_first_search.html index b0057f7d..547b94e3 100644 --- a/doc/depth_first_search.html +++ b/doc/depth_first_search.html @@ -311,7 +311,7 @@ The example in Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/dfs_visitor.html b/doc/dfs_visitor.html index 990117c6..c9ee5114 100644 --- a/doc/dfs_visitor.html +++ b/doc/dfs_visitor.html @@ -102,7 +102,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/dijkstra_visitor.html b/doc/dijkstra_visitor.html index 1e7ec036..5ad9db1d 100644 --- a/doc/dijkstra_visitor.html +++ b/doc/dijkstra_visitor.html @@ -116,7 +116,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/directed_graph.html b/doc/directed_graph.html index 227a3fa3..c20b2383 100644 --- a/doc/directed_graph.html +++ b/doc/directed_graph.html @@ -87,7 +87,7 @@ A simple examples of creating a directed_graph is available here jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/distance_recorder.html b/doc/distance_recorder.html index a6b05fe2..9786371f 100644 --- a/doc/distance_recorder.html +++ b/doc/distance_recorder.html @@ -167,7 +167,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/edge_list.html b/doc/edge_list.html index 7d03b0a1..b52da712 100644 --- a/doc/edge_list.html +++ b/doc/edge_list.html @@ -212,7 +212,7 @@ Returns the target vertex of edge e. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/edge_predecessor_recorder.html b/doc/edge_predecessor_recorder.html index 9ed626b6..e9bee01d 100644 --- a/doc/edge_predecessor_recorder.html +++ b/doc/edge_predecessor_recorder.html @@ -182,7 +182,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/erdos_renyi_generator.html b/doc/erdos_renyi_generator.html index b5adaaf7..090766d9 100644 --- a/doc/erdos_renyi_generator.html +++ b/doc/erdos_renyi_generator.html @@ -144,7 +144,7 @@ int main() Copyright © 2005 Doug Gregor, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University () diff --git a/doc/filtered_graph.html b/doc/filtered_graph.html index 997d5055..2b4b9675 100644 --- a/doc/filtered_graph.html +++ b/doc/filtered_graph.html @@ -526,7 +526,7 @@ num_edges(g))    ) which is assumed in many of the algorithms. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/graph_coloring.html b/doc/graph_coloring.html index 1d4dcb77..87551e2d 100644 --- a/doc/graph_coloring.html +++ b/doc/graph_coloring.html @@ -182,7 +182,7 @@ namespace boost { Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/graph_theory_review.html b/doc/graph_theory_review.html index 625bd654..6fec7b73 100644 --- a/doc/graph_theory_review.html +++ b/doc/graph_theory_review.html @@ -26,7 +26,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 Introduction to Algorithms +href="https://mitpress.mit.edu/algorithms">Introduction to Algorithms by Cormen, Leiserson, and Rivest.

    diff --git a/doc/graph_traits.html b/doc/graph_traits.html index 6071e3bc..4c336e3a 100644 --- a/doc/graph_traits.html +++ b/doc/graph_traits.html @@ -247,7 +247,7 @@ of vertices in the graph. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/gursoy_atun_layout.html b/doc/gursoy_atun_layout.html index 8af8bbea..f65cf5ef 100644 --- a/doc/gursoy_atun_layout.html +++ b/doc/gursoy_atun_layout.html @@ -231,7 +231,7 @@ Equivalent to the non-named vertex_index_map parameter.
    Copyright © 2004 Trustees of Indiana University Jeremiah Willcock, Indiana University ()
    Doug Gregor, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University () diff --git a/doc/hawick_circuits.html b/doc/hawick_circuits.html index 3e6516c6..92eb5995 100644 --- a/doc/hawick_circuits.html +++ b/doc/hawick_circuits.html @@ -25,7 +25,7 @@ self-loops and redundant circuits caused by parallel edges are enumerated too. edges are not desired.

    The algorithm is described in detail in -http://complexity.massey.ac.nz/cstn/013/cstn-013.pdf.

    +https://www.researchgate.net/publication/221440635_Enumerating_Circuits_and_Loops_in_Graphs_with_Self-Arcs_and_Multiple-Arcs.

    Where defined

    diff --git a/doc/history.html b/doc/history.html index fbf34a73..4ee400a6 100644 --- a/doc/history.html +++ b/doc/history.html @@ -19,16 +19,16 @@ The Boost Graph Library began its life as the Generic Graph Component Library (GGCL), a software project at the Lab for Scientific Computing (LSC) at +href="https://web.archive.org/web/20010516042117/http://www.lsc.nd.edu/">Lab for Scientific Computing (LSC) at the University of Notre Dame, under the direction of Professor Andrew Lumsdaine. The Lab's +href="https://homes.cs.washington.edu/~al75">Andrew Lumsdaine. The Lab's research directions include numerical linear algebra, parallel computing, and software engineering (including generic programming).

    Soon after the Standard Template Library was released, work began at the LSC to apply generic programming to scientific computing. The Matrix Template Library +href="https://en.wikipedia.org/wiki/Matrix_Template_Library">Matrix Template Library (Jeremy Siek's masters thesis) was one of the first projects. Many of the lessons learned during construction of the MTL were applied to the design and implementation of the GGCL. @@ -199,7 +199,7 @@ September 27, 2000. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/howard_cycle_ratio.html b/doc/howard_cycle_ratio.html index 0018863d..2835b308 100644 --- a/doc/howard_cycle_ratio.html +++ b/doc/howard_cycle_ratio.html @@ -97,7 +97,7 @@ The algorithm is due to Howard's iteration policy algorithm, descibed in [1]. Ali Dasdan, Sandy S. Irani and Rajesh K.Gupta in their paper Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio -Problemsstate that this is the most efficient algorithm to the time being (1999).

    +Problems state that this is the most efficient algorithm to the time being (1999).

    For the convenience, functions maximum_cycle_mean() and minimum_cycle_mean() @@ -224,7 +224,7 @@ generates a random graph and computes its maximum cycle ratio.

    Copyright © 2006-2009

    -

    Dmitry +

    Dmitry Bufistov, Andrey Parfenov

    diff --git a/doc/incident.html b/doc/incident.html index 703e17f7..87ceffa9 100644 --- a/doc/incident.html +++ b/doc/incident.html @@ -70,7 +70,7 @@ is the target. This function is equivalent to the expression Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/incremental_components.html b/doc/incremental_components.html index ef3ba9b7..a6be2b07 100644 --- a/doc/incremental_components.html +++ b/doc/incremental_components.html @@ -411,7 +411,7 @@ Returns a pair of iterators for the component at index where index< Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/index.html b/doc/index.html index 426edef4..b4e8b650 100644 --- a/doc/index.html +++ b/doc/index.html @@ -297,7 +297,7 @@ iterator and implements an Edge List Graph. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/isomorphism-impl-v2.w b/doc/isomorphism-impl-v2.w index 602db7ee..3cf60878 100644 --- a/doc/isomorphism-impl-v2.w +++ b/doc/isomorphism-impl-v2.w @@ -25,7 +25,7 @@ \fi \ifpdf - \newcommand{\stlconcept}[1]{\href{http://www.sgi.com/tech/stl/#1.html}{{\small \textsf{#1}}}} + \newcommand{\stlconcept}[1]{\href{https://boost.org/sgi/stl/#1.html}{{\small \textsf{#1}}}} \newcommand{\bglconcept}[1]{\href{http://www.boost.org/libs/graph/doc/#1.html}{{\small \textsf{#1}}}} \newcommand{\pmconcept}[1]{\href{http://www.boost.org/libs/property_map/#1.html}{{\small \textsf{#1}}}} \newcommand{\myhyperref}[2]{\hyperref[#1]{#2}} diff --git a/doc/isomorphism-impl-v3.w b/doc/isomorphism-impl-v3.w index 6e35e8e7..95e87eac 100644 --- a/doc/isomorphism-impl-v3.w +++ b/doc/isomorphism-impl-v3.w @@ -31,7 +31,7 @@ \fi \ifpdf - \newcommand{\stlconcept}[1]{\href{http://www.sgi.com/tech/stl/#1.html}{{\small \textsf{#1}}}} + \newcommand{\stlconcept}[1]{\href{https://boost.org/sgi/stl/#1.html}{{\small \textsf{#1}}}} \newcommand{\bglconcept}[1]{\href{http://www.boost.org/libs/graph/doc/#1.html}{{\small \textsf{#1}}}} \newcommand{\pmconcept}[1]{\href{http://www.boost.org/libs/property_map/#1.html}{{\small \textsf{#1}}}} \newcommand{\myhyperref}[2]{\hyperref[#1]{#2}} diff --git a/doc/isomorphism-impl.w b/doc/isomorphism-impl.w index e881a946..868760c4 100644 --- a/doc/isomorphism-impl.w +++ b/doc/isomorphism-impl.w @@ -25,7 +25,7 @@ \fi \ifpdf - \newcommand{\stlconcept}[1]{\href{http://www.sgi.com/tech/stl/#1.html}{{\small \textsf{#1}}}} + \newcommand{\stlconcept}[1]{\href{https://boost.org/sgi/stl/#1.html}{{\small \textsf{#1}}}} \newcommand{\bglconcept}[1]{\href{http://www.boost.org/libs/graph/doc/#1.html}{{\small \textsf{#1}}}} \newcommand{\pmconcept}[1]{\href{http://www.boost.org/libs/property_map/#1.html}{{\small \textsf{#1}}}} \newcommand{\myhyperref}[2]{\hyperref[#1]{#2}} diff --git a/doc/kamada_kawai_spring_layout.html b/doc/kamada_kawai_spring_layout.html index 85ee54a2..60e4ce06 100644 --- a/doc/kamada_kawai_spring_layout.html +++ b/doc/kamada_kawai_spring_layout.html @@ -314,7 +314,7 @@ an std::vector of Topology::point_difference_type.
    Copyright © 2004, 2010 Trustees of Indiana University Douglas Gregor, Indiana University (dgregor -at cs.indiana.edu)
    -Andrew Lumsdaine, Indiana +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/known_problems.html b/doc/known_problems.html index dbf042a1..9684e510 100644 --- a/doc/known_problems.html +++ b/doc/known_problems.html @@ -53,7 +53,7 @@ versions. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/leda_conversion.html b/doc/leda_conversion.html index 6c24c6ab..58526082 100644 --- a/doc/leda_conversion.html +++ b/doc/leda_conversion.html @@ -41,7 +41,7 @@ call this free function wrapper approach external adaptation.

    One of the more commonly used graph classes is the LEDA parameterized GRAPH +href="https://algorithmic-solutions.info/leda_guide/graphs/param_graph.html">GRAPH class [22]. In this section we will show how to create a BGL interface for this class. The first question is which BGL interfaces (or concepts) we @@ -254,7 +254,7 @@ href="../test/graph.cpp">test/graph.cpp. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/null_visitor.html b/doc/null_visitor.html index 902c05d3..df73c844 100644 --- a/doc/null_visitor.html +++ b/doc/null_visitor.html @@ -85,7 +85,7 @@ This does nothing. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/opposite.html b/doc/opposite.html index f9be2e47..cfe10200 100644 --- a/doc/opposite.html +++ b/doc/opposite.html @@ -70,7 +70,7 @@ assert(u == opposite(e, v, g)); Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/plod_generator.html b/doc/plod_generator.html index 5c21f1a3..9e9f7ade 100644 --- a/doc/plod_generator.html +++ b/doc/plod_generator.html @@ -131,7 +131,7 @@ int main() Copyright © 2005 Doug Gregor, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University () diff --git a/doc/predecessor_recorder.html b/doc/predecessor_recorder.html index 6f600eaf..c6f169c8 100644 --- a/doc/predecessor_recorder.html +++ b/doc/predecessor_recorder.html @@ -177,7 +177,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/property_map.html b/doc/property_map.html index 35eb476e..3ed39401 100644 --- a/doc/property_map.html +++ b/doc/property_map.html @@ -77,7 +77,7 @@ href="../../property_map/doc/property_map.html">property map. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/property_put.html b/doc/property_put.html index 9f0ebd8a..8dd7ecb8 100644 --- a/doc/property_put.html +++ b/doc/property_put.html @@ -172,7 +172,7 @@ and time_stamper. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/property_writer.html b/doc/property_writer.html index 008ca632..bb1beab1 100644 --- a/doc/property_writer.html +++ b/doc/property_writer.html @@ -188,7 +188,7 @@ and time_stamper. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/publications.html b/doc/publications.html index 20415342..f38d47ae 100644 --- a/doc/publications.html +++ b/doc/publications.html @@ -21,7 +21,7 @@

  • Dr. Dobb's Sept. 2000 Article
  • OOPSLA'99 GGCL Paper
    • -
  • Lie-Quan Lee's Master's Thesis about GGCL(ps) (pdf)
    • +
  • Lie-Quan Lee's Master's Thesis about GGCL(ps) (pdf)
  • Dietmar Kühl's Master's Thesis: Design Pattern for the Implementation of Graph Algorithms
  • ISCOPE'99 Sparse Matrix Ordering (pdf)
  • C++ Template Workshop 2000, Concept Checking
    • @@ -37,7 +37,7 @@ Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/python.html b/doc/python.html index 797477fe..fd9df3ab 100644 --- a/doc/python.html +++ b/doc/python.html @@ -36,7 +36,7 @@ using the BGL in Python.

    The Python bindings for the BGL are now part of a separate + href="https://web.archive.org/web/20121030074643/http://www.osl.iu.edu:80/~dgregor/bgl-python/">separate project. They are no longer available within the Boost tree.

    @@ -44,7 +44,7 @@ Copyright © 2005 Doug Gregor, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University () diff --git a/doc/r_c_shortest_paths.html b/doc/r_c_shortest_paths.html index 025e25ac..557b962e 100644 --- a/doc/r_c_shortest_paths.html +++ b/doc/r_c_shortest_paths.html @@ -123,7 +123,7 @@ in:
    Desaulniers, G.; Desrosiers, J.; Solomon, M. (eds.) (2005):
    Column Generation
    Springer, New York, pp. 33–65
    -(available online +(available online here)

    diff --git a/doc/random_spanning_tree.html b/doc/random_spanning_tree.html index e6d82f48..474a19dd 100644 --- a/doc/random_spanning_tree.html +++ b/doc/random_spanning_tree.html @@ -151,7 +151,7 @@ IN: weight_map(WeightMap weight) Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/read_dimacs.html b/doc/read_dimacs.html index 3553897a..3c50673c 100644 --- a/doc/read_dimacs.html +++ b/doc/read_dimacs.html @@ -65,7 +65,7 @@ int read_dimacs_min_cut(Graph& g,

    -These functions read a BGL graph object from a max-flow or min-cut problem description in extended dimacs format. (see Goldberg's site for more information). For each edge found in the +These functions read a BGL graph object from a max-flow or min-cut problem description in extended dimacs format. (see Goldberg's site for more information). For each edge found in the file an additional reverse_edge is added and set in the reverse_edge map. For max-flow problems, source and sink vertex descriptors are set according to the dimacs file. diff --git a/doc/sequential_vertex_coloring.html b/doc/sequential_vertex_coloring.html index 30239261..8620be92 100644 --- a/doc/sequential_vertex_coloring.html +++ b/doc/sequential_vertex_coloring.html @@ -107,7 +107,7 @@ in the graph, and k is the number of colors used.
    Copyright © 1997-2004 -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.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 5dfffae5..ed6f1033 100644 --- a/doc/small_world_generator.html +++ b/doc/small_world_generator.html @@ -118,7 +118,7 @@ int main()
    Copyright © 2005 Doug Gregor, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University ()
    diff --git a/doc/sorted_erdos_renyi_gen.html b/doc/sorted_erdos_renyi_gen.html index b61242a5..254d498c 100644 --- a/doc/sorted_erdos_renyi_gen.html +++ b/doc/sorted_erdos_renyi_gen.html @@ -125,7 +125,7 @@ int main() Jeremiah Willcock, Indiana University ()
    Doug Gregor, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University () diff --git a/doc/stanford_graph.html b/doc/stanford_graph.html index 6940364c..6e3a77ea 100644 --- a/doc/stanford_graph.html +++ b/doc/stanford_graph.html @@ -449,7 +449,7 @@ HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/table_of_contents.html b/doc/table_of_contents.html index 4bdeb462..a910be33 100644 --- a/doc/table_of_contents.html +++ b/doc/table_of_contents.html @@ -333,7 +333,7 @@

  • Trouble Shooting
  • Known Problems
  • FAQ -
  • BGL Book Errata +
  • BGL Book Errata

    @@ -348,7 +348,7 @@ Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/time_stamper.html b/doc/time_stamper.html index e2f69f23..c566b98d 100644 --- a/doc/time_stamper.html +++ b/doc/time_stamper.html @@ -187,7 +187,7 @@ and property_writer. Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/topology.html b/doc/topology.html index 57f53e57..2eefd237 100644 --- a/doc/topology.html +++ b/doc/topology.html @@ -272,7 +272,7 @@ class heart_topology Copyright © 2004, 2010 Trustees of Indiana University Jeremiah Willcock, Indiana University ()
    Doug Gregor, Indiana University ()
    - Andrew Lumsdaine, + Andrew Lumsdaine, Indiana University () diff --git a/doc/trouble_shooting.html b/doc/trouble_shooting.html index 5aca7fa9..fe20679c 100644 --- a/doc/trouble_shooting.html +++ b/doc/trouble_shooting.html @@ -120,7 +120,7 @@ for (std::size_t j = 0; j < n_edges; ++j) Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/undirected_dfs.html b/doc/undirected_dfs.html index c29792d4..fe81aced 100644 --- a/doc/undirected_dfs.html +++ b/doc/undirected_dfs.html @@ -333,7 +333,7 @@ An example is in Indiana University (jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/undirected_graph.html b/doc/undirected_graph.html index 09a55b0c..f16eb957 100644 --- a/doc/undirected_graph.html +++ b/doc/undirected_graph.html @@ -87,7 +87,7 @@ A simple example of creating an undirected_graph is available here jsiek@osl.iu.edu)
    Lie-Quan Lee, Indiana University (llee@cs.indiana.edu)
    -Andrew Lumsdaine, +Andrew Lumsdaine, Indiana University (lums@osl.iu.edu) diff --git a/doc/users.html b/doc/users.html index 65b23306..5c154f28 100644 --- a/doc/users.html +++ b/doc/users.html @@ -25,18 +25,18 @@ or form.