boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 08:12:14 +00:00
Code Issues Projects Releases Wiki Activity

fixed some links and added some new doc files

Browse Source 
[SVN r7853]
This commit is contained in:
Jeremy Siek
2000-09-27 05:09:28 +00:00
parent 106c6469a8
commit e80dc97c43
7 changed files with 239 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

79
docs/acknowledgements.html Normal file
View File

@@ -0,0 +1,79 @@
<HTML>
<!--
-- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
--
-- Permission to use, copy, modify, distribute and sell this software
-- and its documentation for any purpose is hereby granted without fee,
-- provided that the above copyright notice appears in all copies and
-- that both that copyright notice and this permission notice appear
-- in supporting documentation. We make no
-- representations about the suitability of this software for any
-- purpose. It is provided "as is" without express or implied warranty.
-->
<Head>
<Title>Boost Graph Library: Acknowledgements</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
ALINK="#ff0000">
<IMG SRC="../../../c++boost.gif"
ALT="C++ Boost" width="277" height="86">
<BR Clear>
<h1>Acknowledgements</h1>
We owe many debts of thanks to a number of individuals who both
inspired and encouraged us in developing the Boost Graph Library.
<p>
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&uuml;hl for
his work on generic graph algorithms and design patterns; especially
for the property map abstraction.
<p>
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.
<p>
We also thank the following BGL users whose questions helped to
improve the BGL: Gordon Woodhull, Dave Longhorn, Joel Phillips, and
Edward Luke.
<p>
A special thanks to Jeffrey Squyres for editing and proof reading
of the documentation.
<p>
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.
<p>
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.
<br>
<HR>
<TABLE>
<TR valign=top>
<TD nowrap>Copyright &copy 2000</TD><TD>
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>,
Univ.of Notre Dame (<A
HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
Univ.of Notre Dame (<A
HREF="mailto:lums@lsc.nd.edu">lums@lsc.nd.edu</A>)
</TD></TR></TABLE>
</BODY>
</HTML>

3
docs/breadth_first_search.html
View File

@@ -230,8 +230,7 @@ The output is:
<h3>See Also</h3>
<a href="./bfs_visitor.html"><tt>bfs_visitor</tt></a>,
<a href="./graph_search.html"><tt>graph_search()</tt></a> and
<a href="./bfs_visitor.html"><tt>bfs_visitor</tt></a> and
<a href="./depth_first_search.html"><tt>depth_first_search()</tt></a>

9
docs/challenge.html
View File

@@ -28,7 +28,8 @@
<li>Polish up code/docs for pending items and champion the formal
review. The pending items are:
<ul>
<li><tt>container_traits.hpp</tt>
<li><tt>container_traits.hpp</tt> (this should also include
the work Matt Austern is doing on this topic)
<li><tt>concept_checks.hpp</tt>
@@ -82,7 +83,11 @@ polygons.
<li>Add a check in the adjacency_list class to make sure
all the vertex property template arguments have kind=vertex_property_tag
and all edge property template arguments have kind=edge_property_tag
and all edge property template arguments have kind=edge_property_tag.
<li>Clean up the output functions in graph_utility.hpp to
use streams, and document all the utility functions. Replace
the random number stuff with calls to the boost random number generator.
</ul>

96
docs/history.html Normal file
View File

@@ -0,0 +1,96 @@
<HTML>
<!--
-- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
--
-- Permission to use, copy, modify, distribute and sell this software
-- and its documentation for any purpose is hereby granted without fee,
-- provided that the above copyright notice appears in all copies and
-- that both that copyright notice and this permission notice appear
-- in supporting documentation. We make no
-- representations about the suitability of this software for any
-- purpose. It is provided "as is" without express or implied warranty.
-->
<Head>
<Title>Boost Graph Library: History</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
ALINK="#ff0000">
<IMG SRC="../../../c++boost.gif"
ALT="C++ Boost" width="277" height="86">
<BR Clear>
<h1>History of the Boost Graph Library</h1>
The Boost Graph Library began its life as the Generic Graph Component
Library (GGCL), a software project at the <a
href="http://www.lsc.nd.edu">Lab for Scientific Computing (LSC)</a> at
the University of Notre Dame, under the direction of Professor <a
href="http://www.lsc.nd.edu/~lums">Andrew Lumsdaine</a>. The Lab's
research directions include numerical linear algebra, parallel
computing, and software engineering (including generic programming).
<p>
Soon after the Standard Template Library was released, work began at
the LSC to apply generic programming to scientific computing. The <a
href="http://www.lsc.nd.edu/research/mtl">Matrix Template Library</a>
(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.
<p>
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&uuml;hl's masters
thess.
<p>
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.
<p>
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.
<p>
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&uuml;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.
<p>
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.
<br>
<HR>
<TABLE>
<TR valign=top>
<TD nowrap>Copyright &copy 2000</TD><TD>
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>,
Univ.of Notre Dame (<A
HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
Univ.of Notre Dame (<A
HREF="mailto:lums@lsc.nd.edu">lums@lsc.nd.edu</A>)
</TD></TR></TABLE>
</BODY>
</HTML>

BIN
docs/iscope99.pdf Normal file
View File

Binary file not shown.

50
docs/publications.html Normal file
View File

@@ -0,0 +1,50 @@
<HTML>
<!--
-- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
--
-- Permission to use, copy, modify, distribute and sell this software
-- and its documentation for any purpose is hereby granted without fee,
-- provided that the above copyright notice appears in all copies and
-- that both that copyright notice and this permission notice appear
-- in supporting documentation. We make no
-- representations about the suitability of this software for any
-- purpose. It is provided "as is" without express or implied warranty.
-->
<Head>
<Title>Boost Graph Library: Publications</Title>
<BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b"
ALINK="#ff0000">
<IMG SRC="../../../c++boost.gif"
ALT="C++ Boost" width="277" height="86">
<BR Clear>
<h1>Boost Graph Library Related Publications<h1>
<ul>
<li><a href="http://www.ddj.com/articles/2000/0009/0009toc.htm">Dr. Dobb's Sept. 2000 Article</a></a></li>
<li><a href="http://www.acm.org/pubs/citations/proceedings/oops/320384/p399-siek/">OOPSLA'99 GGCL Paper</a></li>
<li>Lie-Quan Lee's Master's Thesis about GGCL<a href="http://www.lsc.nd.edu/downloads/research/ggcl/papers/thesis.ps">(ps)</a> <a href="http://www.lsc.nd.edu/downloads/research/ggcl/papers/thesis.pdf">(pdf)</a></li>
<li>Dietmar K&uuml;hl's Master's Thesis: <a href="ftp://ftp.informatik.uni-konstanz.de/pub/algo/personal/kuehl/da.ps.gz">Design Pattern for the Implementation of Graph Algorithms</a></li>
<li><a href="http://www.acl.lanl.gov/iscope99/">ISCOPE'99</a> Sparse Matrix Ordering <a href="./iscope99.pdf">(pdf)</a></li>
<li><a href="http://www.oonumerics.org/tmpw00/">C++ Template Workshop 2000</a>, Concept Checking</li>
</ul>
<br>
<HR>
<TABLE>
<TR valign=top>
<TD nowrap>Copyright &copy 2000</TD><TD>
<A HREF=http://www.boost.org/people/jeremy_siek.htm>Jeremy Siek</A>,
Univ.of Notre Dame (<A
HREF="mailto:jsiek@lsc.nd.edu">jsiek@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~llee1>Lie-Quan Lee</A>, Univ.of Notre Dame (<A HREF="mailto:llee1@lsc.nd.edu">llee1@lsc.nd.edu</A>)<br>
<A HREF=http://www.lsc.nd.edu/~lums>Andrew Lumsdaine</A>,
Univ.of Notre Dame (<A
HREF="mailto:lums@lsc.nd.edu">lums@lsc.nd.edu</A>)
</TD></TR></TABLE>
</BODY>
</HTML>

10
docs/table_of_contents.html
View File

@@ -22,8 +22,10 @@
<h1>Table of Contents: the Boost Graph Library</h1>
<OL>
<LI><A Href="./index.html">Introduction to the
BGL</A>
<LI><A Href="./index.html">Introduction to the BGL</A>
<LI><A Href="./history.html">History</A>
<LI><A Href="./publications.html">Publications</A>
<LI><A Href="./acknowledgements.html">Acknowledgements</A>
<LI><A href="./quick_tour.html">A Quick Tour of the Boost Graph Library.</a>
<LI><A Href="graph_theory_review.html">Review of Elementary Graph Theory</A>
<LI>Boost Graph Library Tutorial
@@ -136,9 +138,9 @@
<LI><A href="./topological_sort.html"><tt>topological_sort</tt></A>
<LI><A href="./transpose_graph.html"><tt>transpose_graph</tt></A>
<LI><A
href="./cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering</tt></A><a href="#*">*</a>
href="../../../boost/graph/cuthill_mckee_ordering.hpp"><tt>cuthill_mckee_ordering</tt></A><a href="#*">*</a>
<LI><A
href="./sequential_vertex_ordering.html"><tt>sequential_vertex_ordering</tt></A><a
href="../../../boost/graph/sequential_vertex_coloring.hpp"><tt>sequential_vertex_coloring</tt></A><a
href="#*">*</a>
</OL>