Changes between Version 1 and Version 2 of GraphVersion2


Ignore:
Timestamp:
Aug 31, 2007, 5:20:52 PM (15 years ago)
Author:
Douglas Gregor
Comment:

Cleanup, add some newer entries

Legend:

Unmodified
Added
Removed
Modified
  • GraphVersion2

    v1 v2  
     1= Boost.Graph Version 2 =
    12Since its initial release in September of 2000, the Boost Graph Library has grown considerably and gained many users. In this time we have noticed certain usability issues, found new techniques and libraries that replace old ones, and extended it in ways not originally considered. It is time to revisit the design of the library to create an even better Boost Graph Library.
    23
     
    56Here are some ideas for changes we would like to make in version 2 of the library. Additional suggestions are welcome:
    67
    7 * Namespaces: move everything into the namespace boost::graph
    8 * Named parameters: use the named parameter library instead of the BGL named parameters mechanism.
    9 * Documentation: Port to Quickbook.
    10 * Usability: Try to address some of the usability issues that keep coming up:
    11 * Property maps: Create a facility that makes it easier to create external property maps for a graph.
    12 * Simple graph types: Create jack-of-all-trades class templates "directed_graph" and "undirected_graph", that make it very easy to add internal properties (e.g., using bundled properties), modify graphs, and use them with algorithms. Compilation speed is very important.
     8 * Namespaces: move everything into the namespace boost::graph
     9 * Named parameters: use the [http://www.boost.org/libs/parameter/ Boost.Parameter] library instead of the BGL named parameters mechanism.
     10 * Documentation: Port to Quickbook (part of ImprovingBoostDocs)
     11 * Usability: Try to address some of the usability issues that keep coming up:
     12   * Property maps: Create a facility that makes it easier to create external property maps for a graph.
     13   * Simple graph types: From Andrew Sutton's [wiki:soc/2007/UserFriendlyGraph user-friend graphs Summer of Code project]
     14   * Named vertices: From the Parallel BGL
     15 * Should we consider bringing in parts of the [http://www.osl.iu.edu/research/pbgl/ Parallel BGL]?