- 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]
- Fixed computation of articulation points
libs/graph/example/biconnected_components.cpp:
- Remove the second example graph: we only need one for a good example
libs/graph/test/biconnected_components_test.cpp, libs/graph/test/Jamfile:
- Randomized testcase verifying the biconnected components & articulation
points computation. Biconnected components aren't thoroughly tested,
but articulation points are.
[SVN r26094]
- Added support for emitting articulation points (they come for free)
- Eliminated unused parameters in public interface
- Provided helper overloads that build the lowpt and discovertime property
maps themselves.
- Added articulation_points function that computes only articulation points
(edge components not included)
libs/graph/example/biconnected_components.cpp:
- Use some of the new overloads
- Output articulation points as filled circles
[SVN r26091]
