Subject: Re: [boost] [review] Heaps: Mergeable Heaps
From: Thorsten Ottosen (thorsten.ottosen_at_[hidden])
Date: 2011-06-06 17:16:29
Den 05-06-2011 15:19, Andrew Sutton skrev:
> I think you should define a MergeableHeap that describes heaps that
> can be merged in O(log n) (i.e., binomial, fibonacci, pairing, skew).
> Actually, the only heaps that don't satisfy this requirement are
> binary heaps, b-heaps and d-ary heaps (they all seem to be linear).
> This is similar to the the AdjacencyMatrix in the BGL.
Please specify what n is. Is it the combined size of the
two heaps or???