boost/pending/relaxed_heap.hpp:

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

index.htm

@@ -121,14 +121,21 @@
                         <h4>Updated Libraries</h4>
 
                         <ul>
-                        <li><a href="libs/graph/doc/index.html">Graph Library</a>: Introduced several new algorithms:
+                        <li><a href="libs/graph/doc/index.html">Graph
+                        Library</a>: Introduced several new algorithms
+                        and improved existing algorithms:
                             <ul>
                             <li><a href="libs/graph/doc/floyd_warshall_shortest.html"><tt>floyd_warshall_all_pairs_shortest_paths</tt></a>, from Lauren Foutz and Scott Hill.</li>
                             <li><a href="libs/graph/doc/astar_search.html"><tt>astar_search</tt></a>, from Kristopher Beevers and Jufeng Peng.</li>
                             <li><a href="libs/graph/doc/fruchterman_reingold.html"><tt>fruchterman_reingold_force_directed_layout</tt></a>, from Doug Gregor and Indiana University.</li>
                             <li><a href="libs/graph/doc/biconnected_components.html"><tt>biconnected_components</tt> and <tt>articulation_points</tt></a>, from Indiana University.</li>
                             <li><a href="libs/graph/doc/sequential_vertex_coloring.html"><tt>sequential_vertex_coloring</tt></a> has been updated, tested, and documented.</li>
-                            <li><a 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/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/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>See the <a href="libs/graph/doc/history.html#by-version">history</a> for additional changes and bug fixes.</li>
                             </ul></li>
                         </ul>

libs/graph

@@ -1 +1 @@
-Subproject commit 77ff4c53b8509fa7e5938cead4bf001b3fd733c8
+Subproject commit 2ffc396f2902b60b71227f7b24dd3eb9309f7369