No there si no such function.
The best solution would be not to use priority queue, but other design.
If it wont work you can try to use splay tree. But it has big overhead.
Theoreticaly best would be fibbonaci heap but it heas even bigger overhead
than splay tree.
2009/8/7 mirosuaf
>
> Hi,
>
>
Hi,
I have a question, as I am using STL priority_queues (quite a lot of
them) and I need to perform many "join" operations... is there a
function for that, to do it in O(lg n) time complexity for each of
joins?
Cheers,
Miroslaw
--~--~-~--~~~---~--~~
You received
-- Forwarded message --
From: sandeep jain
Date: Fri, Aug 7, 2009 at 1:16 PM
Subject: [BSACET:2057] Our initiative GeeksforGeeks
To: bsa...@googlegroups.com
Hi Guys,
Apologies for spamming you if you have seen a similar mail earlier.
We have created a portal http://geeksforgee
