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 <[email protected]> > > 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 this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
