I have found a couple of ways to update a key in the priority queue when I searched online. I am just wondering what way of implementation do you prefer using existing C++ STL data structures?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
I have found a couple of ways to update a key in the priority queue when I searched online. I am just wondering what way of implementation do you prefer using existing C++ STL data structures?
Name |
---|
Just use set instead of a priority queue. It has the same functionality (keys are in sorted order), you can get first key by using *myset.begin(). And if you want to update some key called "key", then you just erase the key using, myset.erase(myset.find(key)), then add the updated version of the key — called "updated_key" — by using, myset.insert(updated_key). This is what I use when i implement dijkstra's algorithm.
Also note, that they "erase", and "find" operations in a set are O(logn), while getting the beginning iterator, "myset.begin()) is only O(1). So this is quite an efficient solution.
This looks good, thanks.
I think you are going to make the same mistake of using set instead of multiset.
Haha I see you read my blog! You are right i just made the same mistake. Thanks for pointing it out!
you can also use
__gnu_pbds::priority_queue
: it hasmodify(iterator, value)