- 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]
- 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]
