Subject: Re: [boost] [1.49.0] New libraries in 1.49.0?
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-02-01 14:15:16
On Thu, 2 Feb 2012, Michel Morin wrote:
> Jeremiah Willcock wrote:
>> On Tue, 31 Jan 2012, Tim Blechmann wrote:
>>> 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.
> I sometimes manipulate huge data (e.g. volume images), and
> space-efficiency is a very important factor there.
> So I would love Boost.Heap to have mutable heap with array-like storage.
> Currently I had to use my own heap class (or boost/pending things).
Look at <boost/graph/detail/d_ary_heap.hpp> as well and see if that helps
you; you'll need to look at <boost/graph/dijkstra_shortest_paths.hpp> for
examples of how to use it.
-- Jeremiah Willcock
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk