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