[boost] Re: Dynamic Priority Queues

From: Andy Glew (glew_at_[hidden])
Date: 1999-06-22 21:54:15

>reprioritization occurs considerably more often than popping (since the STL
>priority queue is *supposed* to be heap-based, you'd want to limit heap
>rebuilds in such a case).

Surely you wouldn't have full heap rebuilds?

Just a bubbleup or down - O(log N)?

------------------------------------------------------------------------

eGroups.com home: http://www.egroups.com/group/boost
http://www.egroups.com - Simplifying group communications