Priority queue
Hi All,
I am trying to implement priority queue in my program.
I know, we can access any element from a priority queue like a vector.But can we actually delete any element from a priority queue rather than the top element(using pop)? We can delete any element from a vector using erase(). Do we have similar functionality for priority queue as well. Thanks.
Sagar
I am trying to implement priority queue in my program.
I know, we can access any element from a priority queue like a vector.But can we actually delete any element from a priority queue rather than the top element(using pop)? We can delete any element from a vector using erase(). Do we have similar functionality for priority queue as well. Thanks.
Sagar
You can't access any element and you can't erase any element.
http://www.cplusplus.com/reference/stl/queue/
Unless you are referring to std::deque.
http://www.cplusplus.com/reference/stl/queue/
Unless you are referring to std::deque.
Topic archived. No new replies allowed.