 |
|
 |
|
On Sat, 28 Jan 2012 09:05:31 -0500, Beman Dawes <...@acm.org
On Sat, Jan 28, 2012 at 8:54 AM, Tim Blechmann <...@klingt.org
Thanks for the info! Boost.Heap is one I've been looking forward to!
--Beman
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
|
|
 |
|
 |
|
|
|
|
On Mon, 30 Jan 2012 13:48:45 -0500, Dave Abrahams <...@boostpro.com
on Sat Jan 28 2012, Tim Blechmann <tim-AT-klingt.org
Nice; will Boost.Graph be using these its algorithms (e.g. Dijkstra)?
--
Dave Abrahams
BoostPro Computing
http://www.boostpro.com
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
|
|
|
|
|
|
|
|
|
On Tue, 31 Jan 2012 02:11:59 +0100, Tim Blechmann <...@klingt.org
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 ...
cheers, tim
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
|
|
|
|
|
|
|
|
|
On Tue, 31 Jan 2012 00:38:48 -0500 (EST), Jeremiah Willcock <...@osl.iu.edu
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
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
|
|
|
|
|
|
|
|
|
On Thu, 2 Feb 2012 01:48:33 +0900, Michel Morin <...@gmail.com
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).
Regards,
Michel
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
|
|
|
|
|
|
|
|
|
On Wed, 1 Feb 2012 14:15:16 -0500 (EST), Jeremiah Willcock <...@osl.iu.edu
Look at <boost/graph/detail/d_ary_heap.hppyou; you'll need to look at <boost/graph/dijkstra_shortest_paths.hppexamples of how to use it.
-- Jeremiah Willcock
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
|
|
|
|
|
|
|
|
|
On Thu, 2 Feb 2012 15:45:39 +0900, Michel Morin <...@gmail.com
Great! I hope this will become public interface.
One concern is that the implementation is specialized for monotonically
decreasing costs (distances in shortest-path problems).
In my applications, the cost can be increased.
Regards,
Michel
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
|
|
|
|
|
|
|