New libraries
Added iterator_adaptor, pool, and test components expanding iterator adaptation, memory pooling, and testing support.
Added iterator_adaptor, pool, and test components expanding iterator adaptation, memory pooling, and testing support.
Updated graph algorithms, including strong_components using Tarjan’s efficient method, boosting analysis speed.
Python integration enhanced; smart pointers now convert to/from Python None, tightening cross‑language compatibility.
Fixed Unicode handling in regular expression implementation, improving stability on international platforms.
Major revision of type traits adds comprehensive introspection features and refined documentation.
March 9th, 2001 12:00 GMT
operator
== for adjacency_list::edge_descriptor
to improve semantics for multigraphs. Moved adjacency_iterator_generator
from namespace detail to
boost and added documentation.
Renamed dynamic_components() to incremental_components(),
better matching graph literature terminology. Cleaned up interface of connected_components() and created separate strong_components()
function using Tarjan's more efficient algorithm. Fixed documentation figures
for adjacency_list
and adjacency_matrix.
Added docs for cuthill_mckee_ordering()
algorithm.
Boost is publicly released three times a year in April, August, and December. Each release has updates to existing libraries, and any new libraries that have passed the rigorous acceptance process.