C++ STL priority queue

Question

I have a question regarding the implementation of priority_queue container adaptor. Now, I know it internally uses the push_heap, pop_heap functions. This is my question:

make_heap turns a vector into a heap in O(n) time by utilizing the heapify algorithm. Is there a similar heapify operation for priority queues in C++ STL? The only possible way of populating a priority_queue that I know of is by manually adding elements. Is there a method for batch insert also in C++ STL for priority_queue. I couldn't find anything on the C++ reference page.

Just pass the vector to `priority_queue`'s constructor. – T.C. Jan 09 '16 at 07:51 — T.C., Jan 09 '16 at 07:51
Thanks a lot. Yeah, should have figured this out on my own. – Manav Garg Jan 09 '16 at 08:02 — Manav Garg, Jan 09 '16 at 08:02

score 0 · Answer 1 · answered Jan 09 '16 at 09:27

0

Why just don't use std::priority_queue ?

http://www.cplusplus.com/reference/queue/priority_queue/

It does all insert/delete operations automatically. So you don't need to worry about keeping your container in priority queue order.

answered Jan 09 '16 at 09:27

ALEXANDER KONSTANTINOV

913
1
7
21

I am using std::priority_queue only. What I wanted to know was whether there was a method for batch insert as inserting in a batch can be done in linear time using heapify algorithm. – Manav Garg Jan 09 '16 at 21:26

C++ STL priority queue

1 Answers1