[Home]Graph Library Version 2

BOOST WIKI | RecentChanges | Preferences | Page List | Links List

Difference (from prior major revision) (no other diffs)

Removed: 9d8
* Python support: mimic the C++ library as closely as possible, to allow prototyping in Python and full implementations in C++. This will not be a part of the main Boost tree; instead, it will be a separate project (BGL-Python) that will handle bindings for both the BGL and Parallel BGL.

Removed: 12d10
** Make vertex/edge descriptors LessThanComparable?: it allows users to put them in std::maps.

Changed: 14c12
** Simple graphs 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.
** 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.

Boost Graph Library Version 2

Since 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 generate an even better Boost Graph Library.

Here are some ideas for changes we would like to make in version 2 of the library. Additional suggestions are welcome.

Some open questions:


BOOST WIKI | RecentChanges | Preferences | Page List | Links List
Edit text of this page | View other revisions
Last edited March 23, 2007 7:06 am (diff)
Search:
Disclaimer: This site not officially maintained by Boost Developers