Priority Queue
Priority Queue
Built as an adaptor on top of another container, typically a vector or a list.
Two template arguments are used with a priority queue: underlying container and a function object that is used to compare elements.
Previous slide
Next slide
Back to first slide
View graphic version