31 Jan
2012
31 Jan
'12
5:38 a.m.
On Tue, 31 Jan 2012, Tim Blechmann wrote:
What are the new libraries in 1.49.0?
boost.heap [1]
cheers, tim
Nice; will Boost.Graph be using these its algorithms (e.g. Dijkstra)?
bgl has its own heap implementations, which are really optimized for its use case as they assume that priority keys are integer values. boost.heap is much more generic, so it might not make sense to change bgl ...
That's something someone should write a benchmark for -- the assumption that keys are integers allows for arrays as storage in some places, but other data structures can be used as well. -- Jeremiah Willcock