projects / ceph.git / blame
| Commit | Line | Data |
|---|---|---|
| 7c673cae FG |
1 | <HTML> |
| 2 | <!-- | |
| 3 | Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000 | |
| 4 | ||
| 5 | Distributed under the Boost Software License, Version 1.0. | |
| 6 | (See accompanying file LICENSE_1_0.txt or copy at | |
| 7 | http://www.boost.org/LICENSE_1_0.txt) | |
| 8 | --> | |
| 9 | <Head> | |
| 10 | <Title>Boost Graph Library: History</Title> | |
| 11 | <BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" | |
| 12 | ALINK="#ff0000"> | |
| 13 | <IMG SRC="../../../boost.png" | |
| 14 | ALT="C++ Boost" width="277" height="86"> | |
| 15 | ||
| 16 | <BR Clear> | |
| 17 | ||
| 18 | <h1>History of the Boost Graph Library</h1> | |
| 19 | ||
| 20 | The Boost Graph Library began its life as the Generic Graph Component | |
| 21 | Library (GGCL), a software project at the <a | |
| 22 | href="http://www.lsc.nd.edu">Lab for Scientific Computing (LSC)</a> at | |
| 23 | the University of Notre Dame, under the direction of Professor <a | |
| 24 | href="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</a>. The Lab's | |
| 25 | research directions include numerical linear algebra, parallel | |
| 26 | computing, and software engineering (including generic programming). | |
| 27 | ||
| 28 | <p> | |
| 29 | Soon after the Standard Template Library was released, work began at | |
| 30 | the LSC to apply generic programming to scientific computing. The <a | |
| 31 | href="http://www.lsc.nd.edu/research/mtl">Matrix Template Library</a> | |
| 32 | (Jeremy Siek's masters thesis) was one of the first projects. Many of | |
| 33 | the lessons learned during construction of the MTL were applied to the | |
| 34 | design and implementation of the GGCL. | |
| 35 | ||
| 36 | <p> | |
| 37 | Graph algorithms play an important role in sparse matrix computations, | |
| 38 | so the LSC had a need for a good graph library. However, none of the | |
| 39 | available graph libraries (LEDA, GTL, Stanford GraphBase) were | |
| 40 | written using the generic programming style of the STL, and hence did | |
| 41 | not fulfill the flexibility and high-performance requirements of the | |
| 42 | LSC. Others were also expressing interest in a generic C++ graph | |
| 43 | library. During a meeting with Bjarne Stroustrup we were introduced to | |
| 44 | several people at AT\&T who needed such a library. There had also been | |
| 45 | earlier work in the area of generic graph algorithms, including some | |
| 46 | codes written by Alexander Stepanov, and Dietmar Kühl's masters | |
| 47 | thesis. | |
| 48 | ||
| 49 | <p> | |
| 50 | With this in mind, and motivated by homework assignments in his | |
| 51 | algorithms class, Jeremy began prototyping an interface and some graph | |
| 52 | classes in the spring on 1998. Lie-Quan Lee then developed the first | |
| 53 | version of GGCL, which became his masters thesis project. | |
| 54 | ||
| 55 | <p> | |
| 56 | The following year, Jeremy went to work for SGI with Alexander | |
| 57 | Stepanov and Matt Austern. During this time Alex's disjoint-sets based | |
| 58 | connected components algorithm was added to GGCL, and Jeremy began | |
| 59 | working on the concept documentation for GGCL similar to Matt's STL | |
| 60 | documentation. | |
| 61 | ||
| 62 | <p> | |
| 63 | While working at SGI, Jeremy heard about Boost and was excited to find | |
| 64 | a group of people interested in creating high-quality C++ | |
| 65 | libraries. At boost there were several people interested in generic | |
| 66 | graph algorithms, most notably Dietmar Kühl. Some discussions | |
| 67 | about generic interfaces for graph structures resulted in the a | |
| 68 | revision of GGCL which closely resembles the current Boost Graph | |
| 69 | Library interface. | |
| 70 | ||
| 71 | <p> | |
| 72 | On September 4, 2000 GGCL passed the Boost formal review and became | |
| 73 | the Boost Graph Library (BGL). The first release of BGL was | |
| 74 | September 27, 2000. | |
| 75 | ||
| 76 | <h2>Changes by version</h2> | |
| 77 | <a name="by-version"> | |
| 78 | <ul> | |
| 79 | <a name="1.36.0"></a><li>Version 1.36.0<br><b>New algorithms and components</b> | |
| 80 | <ul> | |
| 81 | <li><a href="r_c_shortest_paths.html"><tt>r_c_shortest_paths</tt></a>, resource-constrained shortest paths, from Michael Drexl.</li> | |
| 82 | </ul> | |
| 83 | </li> | |
| 84 | ||
| 85 | <a name="1.35.0"></a><li>Version 1.35.0<br><b>New algorithms and components</b> | |
| 86 | <ul> | |
| 87 | <li><a href="boykov_kolmogorov_max_flow.html"><tt>boykov_kolmogorov_max_flow</tt></a> (formerly kolmogorov_max_flow), from Stephan Diederich as part of the <a href="http://code.google.com/soc/">2006 Google Summer of Code</a>.</li> | |
| 88 | <li><a href="read_dimacs.html">read_dimacs_max_flow</a> and <a href="write_dimacs.html">write_dimacs_max_flow</a> for max-flow problems, from Stephan Diederich.</li> | |
| 89 | <li><a href="read_graphml.html">read_graphml</a> and <a href="write_graphml.html">write_graphml</a> for <a href="http://graphml.graphdrawing.org/">GraphML</a> input/output, from Tiago de Paula Peixoto.</li> | |
| 90 | <li><a href="howard_cycle_ratio.html"><tt>minimum_cycle_ratio</tt> and <tt>maximum_cycle_ratio</tt></a>, from Dmitry Bufistov and Andrey Parfenov.</li> | |
| 91 | <li><a href="boyer_myrvold.html"><tt>boyer_myrvold_planarity_test</tt></a>, along with a suite of <a href="planar_graphs.html">algorithms for planar graphs</a>, from Aaron Windsor.</li> | |
| 92 | </ul><br><b>Enhancements</b><br> | |
| 93 | <ul> | |
| 94 | <li><a href="leda_conversion.html">LEDA Adaptor</a> improvements, from Jens Müller.</li> | |
| 95 | </ul> | |
| 96 | </li><br> | |
| 97 | ||
| 98 | <a name="1.34.1"></a><li>Version 1.34.1</br><b>Bug Fixes</b><br> | |
| 99 | <ul> | |
| 100 | <li><a href="bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></a>: fixed a bug where certain negative cycles were not correctly detected.</li> | |
| 101 | </ul> | |
| 102 | <a name="1.34.0"></a><li>Version 1.34.0<br><b>New algorithms and components</b> | |
| 103 | <ul> | |
| 104 | <li><a href="maximum_matching.html"><tt>edmonds_maximum_cardinality_matching</tt></a>, from Aaron Windsor.</li> | |
| 105 | <li><a href="lengauer_tarjan_dominator.htm"><tt>lengauer_tarjan_dominator_tree</tt></a>, from JongSoo Park.</li> | |
| 106 | <li><a href="compressed_sparse_row.html"><tt>compressed_sparse_row_graph</tt></a>, from Jeremiah Willcock and Douglas Gregor of Indiana University.</li> | |
| 107 | <li><a href="sorted_erdos_renyi_gen.html"><tt>sorted_erdos_renyi_iterator</tt></a>, from Jeremiah Willcock of Indiana University.</li> | |
| 108 | </ul><br><b>Enhancements</b><br> | |
| 109 | <ul> | |
| 110 | <li>Note: the name of the compiled library for GraphViz reading is now called <code>boost_graph</code> rather than <code>bgl-viz</code>.</li> | |
| 111 | <li><a href="biconnected_components.html"><tt>biconnected_components</tt></a> now has a visitor parameter and supports named parameters, from Janusz Piwowarski.</li> | |
| 112 | <li><a href="adjacency_matrix.html"><tt>adjacency_matrix</tt></a> now models the <a href="BidirectionalGraph.html">Bidirectional Graph</a> concept.</li> | |
| 113 | <li><a href="adjacency_list.html"><tt>adjacency_list</tt></a> is now <a href="../../serialization/doc/index.html">Serializable</a>, from Jeremy Siek of Rice University.</li> | |
| 114 | <li>Added <tt>edges_size_type</tt> and <tt>vertices_size_type</tt> to <tt>adjacency_list_traits</tt>, from Jeremy Siek of Rice University.</li> | |
| 115 | <li>Added <tt>operator< </tt>, etc. to the edge descriptor of <tt>adjacency_list</tt>, | |
| 116 | from Jeremy Siek of Rice University.</li> | |
| 117 | </ul> | |
| 118 | <br><b>Bug Fixes</b><br> | |
| 119 | <ul> | |
| 120 | <li>Fixed a bug that causes the relaxed heap to fail on x86 Linux.</li> | |
| 121 | <li>Bundled properties now work with adjacency list I/O.</li> | |
| 122 | <li><a href="floyd_warshall_shortest.html"><tt>floyd_warshall_all_pairs_shortest_paths</tt></a> now properly uses its <tt>compare</tt>, <tt>inf</tt>, and <tt>zero</tt> parameters.</li> | |
| 123 | <li><a href="johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></a> now supports <tt>compare</tt>, <tt>combine</tt>, <tt>inf</tt>, and <tt>zero</tt>.</li> | |
| 124 | <li>Fixed a bug in smallest_last_vertex_ordering.hpp which could cause a vertex to be moved to the wrong bucket during an BucketSorter update. | |
| 125 | </ul> | |
| 126 | <br> | |
| 127 | </li> | |
| 128 | ||
| 129 | <li>Version 1.33.1<br><b>Bug Fixes</b> | |
| 130 | <ul> | |
| 131 | <li><a href="fruchterman_reingold.html"><TT>fruchterman_reingold_force_directed_layout</TT></A>: Fixed enumeration of grid-force pairs, which caused some odd graph formations along grid lines.</li> | |
| 132 | <li><a href="king_ordering.html"><tt>king_ordering</tt></a> and <a | |
| 133 | href="cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering</tt></a>: Fixed bug that caused failures with the multi-component version of these algorithms.</li> | |
| 134 | </ul></li> | |
| 135 | ||
| 136 | <li>Version 1.33.0<br><b>New algorithms and components</b> | |
| 137 | <ul> | |
| 138 | <li><a href="python.html">Experimental Python bindings</a>, from Doug Gregor and Indiana University.</li> | |
| 139 | <LI><A href="floyd_warshall_shortest.html"><TT>floyd_warshall_all_pairs_shortest_paths</TT></A>, from Lauren Foutz and Scott Hill.</LI> | |
| 140 | <LI><A href="astar_search.html"><TT>astar_search</TT></A>, from Kristopher Beevers and Jufeng Peng.</LI> | |
| 141 | <LI><A href="fruchterman_reingold.html"><TT>fruchterman_reingold_force_directed_layout</TT></A>, from Doug Gregor and Indiana University.</a></LI> | |
| 142 | <LI><A href="biconnected_components.html"><tt>biconnected_components</tt> and <tt>articulation_points</tt></a>, from Indiana University.</a></li> | |
| 143 | <li><a href="gursoy_atun_layout.html"><tt>gursoy_atun_layout</tt></a>, from Jeremiah Willcock and Doug Gregor of Indiana University.</li> | |
| 144 | <li><a href="king_ordering.html"><tt>king_ordering</tt></a>, from | |
| 145 | D. Kevin McGrath of Indiana University.</li> | |
| 146 | <li><a href="erdos_renyi_generator.html"><tt>erdos_renyi_iterator</tt></a></li> | |
| 147 | <li><a href="plod_generator.html"><tt>plod_iterator</tt></a></li> | |
| 148 | <li><a href="small_world_generator.html"><tt>small_world_iterator</tt></a></li> | |
| 149 | </ul><br><b>Enhancements</b><br> | |
| 150 | <ul> | |
| 151 | <li><a href="bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></a> now permits one to specify the starting vertex, so that it will perform its own initialization.</li> | |
| 152 | <li><a href="undirected_dfs.html"><tt>undirected_dfs</tt></a> is now data-recursive, resulting in improved performance in some cases, from Synge Todo.</li> | |
| 153 | <li><a href="dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></a> now uses a relaxed heap [<A | |
| 154 | HREF="bibliography.html#driscoll88">61</A>] as its priority queue, improving its complexity to <em>O(V log V)</em> and improving real-world performance for larger graphs.</li> | |
| 155 | <li><a href="read_graphviz.html"><code>read_graphviz</code></a> now has a new, Spirit-based parser that works for all graph types and supports arbitrary properties on the graph, from Ron Garcia. The old, Bison-based GraphViz reader has been deprecated and will be removed in a future Boost release.</li> | |
| 156 | ||
| 157 | <li><a | |
| 158 | href="write-graphviz.html"><code>write_graphviz</code></a> now | |
| 159 | supports output of dynamic properties (as read in through the | |
| 160 | new <code>read_graphviz</code>).</li> | |
| 161 | ||
| 162 | <li><a | |
| 163 | href="cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering</tt></a> | |
| 164 | has been recast as an invocation of | |
| 165 | <tt>breadth_first_search</tt> and now supports graphs with | |
| 166 | multiple components.</li> | |
| 167 | ||
| 168 | <li><a href="subgraph.html"><tt>subgraph</tt></a> now supports | |
| 169 | <a href="bundles.html">bundled | |
| 170 | properties</a>. <code>get_property</code> now refers to the | |
| 171 | subgraph property, not the root graph's property.</li></li> | |
| 172 | ||
| 173 | <li><a href="filtered_graph.html"><tt>filtered_graph</tt></a> now | |
| 174 | supports <a href="bundles.html">bundled properties</a>.</li> | |
| 175 | ||
| 176 | <li><a href="reverse_graph.html"><tt>reverse_graph</tt></a> now | |
| 177 | supports <a href="bundles.html">bundled properties</a>, | |
| 178 | <tt>set_property</tt>, and <tt>get_property</tt>.</li> | |
| 179 | ||
| 180 | </ul><br><b>Bug fixes</b><br> | |
| 181 | <ul> | |
| 182 | <li><a href="bellman_ford_shortest.html"><tt>bellman_ford_shortest_paths</tt></a> now deals with unreachable vertices better.</li> | |
| 183 | <li><a href="adjacency_list.html"><tt>adjacency_list</tt></a>: parallel edge removal with <tt>OutEdgeListS = listS</tt> has been fixed. Copying and swapping has been fixed.</li> | |
| 184 | <li><a href="incremental_components.html">Incremental connected components</a>: fixed a bug in the <tt>incremental_components</tt> routine that may have caused incorrect results.</li> | |
| 185 | <li>The <tt>remove_out_edge_if</tt> function for an undirected <a href="adjacency_list.html"><tt>adjacency_list</tt></a> has been rewritten and should no longer dereference singular iterators.</li> | |
| 186 | <li><a href="write-graphviz.html"><tt>write_graphviz</tt></a> now accepts a <tt>vertex_id</tt> parameter that is used to name the nodes.</li> | |
| 187 | <li><a href="read_graphviz.html"><tt>read_graphviz</tt></a> now accepts empty attribute lists.</li> | |
| 188 | <li><a href="sequential_vertex_coloring.html"><tt>sequential_vertex_coloring</tt></a> has been updated, tested, and documented.</li> | |
| 189 | </ul> | |
| 190 | </li> | |
| 191 | </ul> | |
| 192 | ||
| 193 | <br> | |
| 194 | <HR> | |
| 195 | <TABLE> | |
| 196 | <TR valign=top> | |
| 197 | <TD nowrap>Copyright © 2000-2001</TD><TD> | |
| 198 | <A HREF="http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek</A>, | |
| 199 | Indiana University (<A | |
| 200 | HREF="mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu</A>)<br> | |
| 201 | <A HREF="http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee</A>, Indiana University (<A HREF="mailto:llee@cs.indiana.edu">llee@cs.indiana.edu</A>)<br> | |
| 202 | <A HREF="http://www.osl.iu.edu/~lums">Andrew Lumsdaine</A>, | |
| 203 | Indiana University (<A | |
| 204 | HREF="mailto:lums@osl.iu.edu">lums@osl.iu.edu</A>) | |
| 205 | </TD></TR></TABLE> | |
| 206 | ||
| 207 | </BODY> | |
| 208 | </HTML> | |
| 209 | <!-- LocalWords: gif ALT GGCL LSC Lumsdaine Siek's MTL LEDA GTL GraphBase STL | |
| 210 | --> | |
| 211 | <!-- LocalWords: Bjarne Stroustrup hl's Quan SGI Stepanov Austern Alex's hl | |
| 212 | --> | |
| 213 | <!-- LocalWords: Dietmar BGL siek htm Univ | |
| 214 | --> |