- Relaxed heap data structure implementation
boost/graph/dijkstra_shortest_paths.hpp:
- Use relaxed heap, with a debugging option allowing one to use the binary
heap instead
libs/graph/test/relaxed_heap_test.cpp:
- Comprehensive test of the relaxed heap
libs/graph/test/dijkstra_heap_performance.cpp:
- Test the performance of the relaxed heap against the binary heap via
Erdos-Renyi graphs.
libs/graph/test/Jamfile:
- Introduce tests of relaxed heap
libs/graph/doc/dijkstra_shortest_paths.html:
- Updated complexity to O(V log V), finally!
- Cite relaxed heaps paper
libs/graph/doc/bibliography.html:
- Added relaxed heap reference
index.htm, libs/graph/doc/history.html:
- Announce introduction of relaxed heap
[SVN r26623]
- Document the existence of the biconnected components algorithm
libs/graph/example/biconnected_components.cpp:
- Clean up the GraphViz output a bit
libs/graph/doc/figs/biconnected.dot, libs/graph/doc/figs/biconnected.png,
libs/graph/doc/biconnected_components.html:
- Documentation for biconnected components and articulation points
boost/graph/biconnected_components.hpp:
- Minor type tweaks
[SVN r26105]
The ->* syntax has been removed. Instead, one may use the member pointer as
the key for the standard get/put functions of property maps. This makes
graph adaptors work with bundled properties (automagically). Also added
support for bundled properties in adjacency_matrix.
index.htm: Announce the addition of bundled properties.
boost/graph/adjacency_list.hpp: Updated to support get/put for bundled
properties.
boost/graph/adjacency_matrix.hpp: Added support for bundled properties.
Suppressed some warnings and fixed a minor bug in add_edge(u, v, ep, g).
boost/graph/properties.hpp: Added property_map specialization for bundled
properties.
libs/graph/doc/*.html: Document uses of bundled properties and direct anyone
not using a broken compiler to bundled properties instead of property lists.
libs/graph/test/bundled_properties.cpp: Test both adjacency_list and
adjacency_matrix, along with filtered_graph. Makes sure all of the bundled
properties operations work.
[SVN r23125]
index.htm:
- Announce bundled properties
libs/graph/doc/bundles.html:
- Document bundled properties
libs/graph/doc/adjacency_list.html:
- Refer to bundled properties
boost/graph/properties.hpp:
- Added vertex_bundle and edge_bundle properties for bundling
- Added bundle_property_map for directly handling bundles
boost/pending/property.hpp:
- Added retag_property_list metafunction that allows us to add a tag
to the non-property<> element at the end of a property<> list.
boost/graph/adjacency_list.hpp:
- Implement bundled properties
libs/graph/test/Jamfile, libs/graph/test/bundled_properties.cpp:
- Test bundled properties
[SVN r22819]
- Implemented Edward Diener's slot ordering proposal:
http://article.gmane.org/gmane.comp.lib.boost.devel/25152/
- Update most copyrights to include 2004
boost/signals/detail/named_slot_map.hpp, libs/signals/src/named_slot_map.cpp:
- Implements the underlying data structure of slots, using a map of lists.
libs/signals/test/ordering_test.cpp:
- Also test at_front/at_back ordering
libs/signals/test/random_signal_system.cpp:
- Deal with changes in random library
libs/signals/doc/tutorial.xml:
- Take away all that nondeterministic ordering mumbo-jumbo
- Briefly mention at_front/at_back
libs/signals/doc/reference/signal_header.xml:
- Add "at" parameter to connect routines
[SVN r22737]
libs/signals/src/signal_base.cpp:
- Moved combiner into "impl" so that its state remains safe even when
the signal is deleted.
boost/signals/signal_template.hpp:
- Provide access to combiner via combiner() method
libs/signals/doc/reference/signal_header.xml:
- Document combiner() methods
index.htm:
- Announce this change for the next version
[SVN r22468]
