diff --git a/docs/acknowledgements.html b/docs/acknowledgements.html new file mode 100644 index 00000000..9f46d689 --- /dev/null +++ b/docs/acknowledgements.html @@ -0,0 +1,79 @@ + + + +Boost Graph Library: Acknowledgements + +C++ Boost + +
+ + +

Acknowledgements

+ +We owe many debts of thanks to a number of individuals who both +inspired and encouraged us in developing the Boost Graph Library. + +

+A most profound thanks goes to Alexander Stepanov for his pioneering +work in generic programming, for his encouragement, and for his +algorithm contributions to the BGL. We thank Matthew Austern for his +work on documenting the concepts of STL which provided a foundation +for creating the concepts in the BGL. We thank Dietmar Kühl for +his work on generic graph algorithms and design patterns; especially +for the property map abstraction. + +

+Dave Abrahams, Jens Maurer, Beman Dawes, Gary Powell, Greg Colvin, +Valentin Bonnard, and the rest of the group at Boost provided valuable +input to the BGL interface, numerous suggestions for improvement, +proof reads of the documentation, and help with polishing the code. + +

+We also thank the following BGL users whose questions helped to +improve the BGL: Gordon Woodhull, Dave Longhorn, Joel Phillips, and +Edward Luke. + +

+A special thanks to Jeffrey Squyres for editing and proof reading +of the documentation. + +

+Our original work on the Boost Graph Library was supported in part by +NSF grant ACI-9982205 and by the Director, Office of Science, Division +of Mathematical, Information, and Computational Sciences of the U.S. +Department of Energy under contract number DE-AC03-76SF00098. +

+In our work we also used resources of the National Energy Research +Scientific Computing Center, which is supported by the Office of +Science of the U.S. Department of Energy. + + + +
+

+ + +
Copyright © 2000 +Jeremy Siek, +Univ.of Notre Dame (jsiek@lsc.nd.edu)
+Lie-Quan Lee, Univ.of Notre Dame (llee1@lsc.nd.edu)
+Andrew Lumsdaine, +Univ.of Notre Dame (lums@lsc.nd.edu) +
+ + + diff --git a/docs/breadth_first_search.html b/docs/breadth_first_search.html index abe33833..b534fc2a 100644 --- a/docs/breadth_first_search.html +++ b/docs/breadth_first_search.html @@ -230,8 +230,7 @@ The output is:

See Also

-bfs_visitor, -graph_search() and +bfs_visitor and depth_first_search() diff --git a/docs/challenge.html b/docs/challenge.html index c5c54be7..88e19630 100644 --- a/docs/challenge.html +++ b/docs/challenge.html @@ -28,7 +28,8 @@
  • Polish up code/docs for pending items and champion the formal review. The pending items are: diff --git a/docs/history.html b/docs/history.html new file mode 100644 index 00000000..0ea52d70 --- /dev/null +++ b/docs/history.html @@ -0,0 +1,96 @@ + + + +Boost Graph Library: History + +C++ Boost + +
    + +

    History of the Boost Graph Library

    + +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 +the University of Notre Dame, under the direction of Professor 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 +(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. + +

    +Graph algorithms play an important role in sparse matrix computations, +so the LSC had a need for a good graph library. However, none of the +available graph libraries (LEDA, GTL, Stanford GraphBase) were +written using the generic programming style of the STL, and hence did +not fulfill the flexibility and high-performance requirements of the +LSC. Others were also expressing interest in a generic C++ graph +library. During a meeting with Bjarne Stroustrup we were introduced to +several people at AT\&T who needed such a library. There had also been +earlier work in the area of generic graph algorithms, including some +codes written by Alexander Stepanov, and Dietmar Kühl's masters +thess. + +

    +With this in mind, and motivated by homework assignments in his +algorithms class, Jeremy began prototyping an interface and some graph +classes in the spring on 1998. Lie-Quan Lee then developed the first +version of GGCL, which became his masters thesis project. + +

    +The following year, Jeremy went to work for SGI with Alexander +Stepanov and Matt Austern. During this time Alex's disjoint-sets based +connected components algorithm was added to GGCL, and Jeremy began +working on the concept documentation for GGCL similar to Matt's STL +documentation. + +

    +While working at SGI, Jeremy heard about Boost and was excited to find +a group of people interested in creating high-quality C++ +libraries. At boost there were several people interested in generic +graph algorithms, most notably Dietmar Kühl. Some discussions +about generic interfaces for graph structures resulted in the a +revision of GGCL which closely resembles the current Boost Graph +Library interface. + +

    +On September 4, 2000 GGCL passed the Boost formal review and became +the Boost Graph Library (BGL). The first release of BGL was +September 27, 2000. + + +
    +

    + + +
    Copyright © 2000 +Jeremy Siek, +Univ.of Notre Dame (jsiek@lsc.nd.edu)
    +Lie-Quan Lee, Univ.of Notre Dame (llee1@lsc.nd.edu)
    +Andrew Lumsdaine, +Univ.of Notre Dame (lums@lsc.nd.edu) +
    + + + diff --git a/docs/iscope99.pdf b/docs/iscope99.pdf new file mode 100644 index 00000000..afed76cd Binary files /dev/null and b/docs/iscope99.pdf differ diff --git a/docs/publications.html b/docs/publications.html new file mode 100644 index 00000000..a6859525 --- /dev/null +++ b/docs/publications.html @@ -0,0 +1,50 @@ + + + +Boost Graph Library: Publications + +C++ Boost + +
    + +

    Boost Graph Library Related Publications

    + + + + +
    +
    + + +
    Copyright © 2000 +Jeremy Siek, +Univ.of Notre Dame (jsiek@lsc.nd.edu)
    +Lie-Quan Lee, Univ.of Notre Dame (llee1@lsc.nd.edu)
    +Andrew Lumsdaine, +Univ.of Notre Dame (lums@lsc.nd.edu) +
    + + + diff --git a/docs/table_of_contents.html b/docs/table_of_contents.html index 73d6808e..ae5baaf6 100644 --- a/docs/table_of_contents.html +++ b/docs/table_of_contents.html @@ -22,8 +22,10 @@

    Table of Contents: the Boost Graph Library

      -
    1. Introduction to the - BGL +
    2. Introduction to the BGL +
    3. History +
    4. Publications +
    5. Acknowledgements
    6. A Quick Tour of the Boost Graph Library.
    7. Review of Elementary Graph Theory
    8. Boost Graph Library Tutorial @@ -136,9 +138,9 @@
    9. topological_sort
    10. transpose_graph
    11. cuthill_mckee_ordering* + href="../../../boost/graph/cuthill_mckee_ordering.hpp">cuthill_mckee_ordering*
    12. sequential_vertex_orderingsequential_vertex_coloring*