- Support for multiple components
- Recast as invocation of breadth_first_search
boost/graph/king_ordering.hpp:
- King's algorithm for sparse matrix ordering
boost/graph/detail/sparse_ordering.hpp:
- Details for the sparse matrix ordering algorithms
libs/graph/example/king_ordering.cpp,
libs/graph/example/cuthill_mckee_ordering.cpp:
- Usage examples for the sparse matrix ordering algorithms
libs/graph/doc/bibliography.html, libs/graph/doc/cuthill_mckee_ordering.html,
libs/graph/doc/king_ordering.html:
- Updated documentation to reflect new implementations
libs/graph/doc/history.html, index_1_33_0.htm:
- Announcements
[SVN r27907]
- 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]
