Hello,
I'm looking for a free implementation of a priority deque that plays
well with the STL. I have only been able to find a few papers (for
instance
http://www.cphstl.dk/Report/Priority...t-2001-14.pdf),
but no code whatsoever.
Just to be clear: a priority deque is like a priority queue but allows
you to remove both the largest and smallest element.
Thanks.
I'm looking for a free implementation of a priority deque that plays
well with the STL. I have only been able to find a few papers (for
instance
http://www.cphstl.dk/Report/Priority...t-2001-14.pdf),
but no code whatsoever.
Just to be clear: a priority deque is like a priority queue but allows
you to remove both the largest and smallest element.
Thanks.