Updateable Priority Queue

Posted by user1427661 on Stack Overflow See other posts from Stack Overflow or by user1427661
Published on 2013-11-03T06:04:55Z Indexed on 2013/11/03 9:54 UTC
Read the original article Hit count: 132

Filed under:

Is there anything built into the C++ Standard Library that allows me to work in a priority queue/heap like data structure (i.e., can always pop the highest value from the list, can define how the highest value is determined for custom classes, etc.) but allows me to update the keys in the heap? I'm dealing with fairly simple data, pairs to be exact, but I need to be able to update the value of a given key within the heap easily for my algorithm to function. WHat is the best way to achieve this in C++?

© Stack Overflow or respective owner

Related posts about c++