Browse Source

boost/graph/cuthill_mckee_ordering.hpp:
- 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]

Douglas Gregor 21 years ago
parent
commit
ef8fe6a145
2 changed files with 8 additions and 1 deletions
  1. 7 0
      index_1_33_0.htm
  2. 1 1
      libs/graph

+ 7 - 0
index_1_33_0.htm

@@ -141,6 +141,13 @@
                             href="libs/graph/doc/gursoy_atun_layout.html"><tt>gursoy_atun_layout</tt></a>,
                             from Jeremiah Willcock and Doug Gregor of
                             Indiana University.</li>
+                            <li><a href="libs/graph/doc/king_ordering.html"><tt>king_ordering</tt></a>, from
+      D. Kevin McGrath of Indiana University.</li>
+                            <li><a
+      href="libs/graph/doc/cuthill_mckee_ordering.html"><tt>cuthill_mckee_ordering</tt></a>
+      has been recast as an invocation of
+      <tt>breadth_first_search</tt> and now supports graphs with
+      multiple components.</li>
                             <li><a href="libs/graph/doc/dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></a> now uses a relaxed heap&nbsp;[<A
   HREF="libs/graph/doc/bibliography.html#driscoll88">61</A>] as its priority queue, improving its complexity to <em>O(V log V)</em> and improving real-world performance for larger graphs.</li>
                             <li><a href="libs/graph/doc/read_graphviz.html"><code>read_graphviz</code></a> now has a new, Spirit-based parser that works for all graph types and supports arbitrary properties on the graph, from Ron Garcia. The old, Bison-based GraphViz reader has been deprecated and will be removed in a future Boost release. <a href="libs/graph/doc/write-graphviz.html"><code>write_graphviz</code></a> also supports dynamic properties.</li>

+ 1 - 1
libs/graph

@@ -1 +1 @@
-Subproject commit e3455c28eb2026343b1490d2bfaccf36ad32808d
+Subproject commit 9eb9501c2740f8a8f590aa2c61058bc452627d0f

粤ICP备19079148号