I want a priority queue where I can iterate and modify. In other words, non-constant iterator.
It seems that the
std::priority_queue<T> does not support changing values of keys to protect corruption of the structure.
I found boost::heap::prioity_queue to support mutability of keys of priority_queue / modification of values with update functions to maintain invariant of data structure.
boost also supports iterators, yet they are const iterators and do not allow change.