src/python/basic_graph.cpp src/python/basic_graph.hpp:
- Add ability to record the names of vertices input via the adjacency list
reader.
example/python/breadth_first_search.py: Building a better example
[SVN r28350]
libs/graph/src/python/basic_graph.cpp, libs/graph/src/python/basic_graph.hpp:
- Allow one to build a graph from anything that looks like a Python list or
tuple.
[SVN r28324]
- Remove use of connected components, so we need only one color map
running around
- Provide simple overloads, requiring only the graph and the output iterator.
boost/graph/detail/sparse_ordering.hpp:
- Move out_degree_property_map here
boost/graph/fruchterman_reingold.hpp:
- Fix enumeration of pairs in grid_force_pairs to repulse vertices in
adjacent grid cells (in addition to the current cell), so we don't get
vertices forming crosses on grid lines.
- Round up the number of rows/columns.
libs/graph/doc/cuthill_mckee_ordering.html, libs/graph/doc/king_ordering.html:
- Document new overloads
libs/graph/doc/gursoy_atun_layout.html:
- Add missing semicolon
libs/graph/src/python/cuthill_mckee_ordering.cpp,
libs/graph/test/cuthill_mckee_ordering.cpp:
- Test and use the new overloads
libs/graph/build/python/Jamfile, libs/graph/src/python/module.cpp,
libs/graph/src/python/king_ordering.cpp:
- Support King's ordering algorithm from Python
libs/graph/example/python/vis.py:
- By default, do a "progressive" Fruchterman-Reingold layout
libs/graph/test/king_ordering.cpp:
- Test new overload
[SVN r28306]
- 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]
