Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:C++_Standard_Library_container_adapter
|
| gptkbp:canBeMinHeapWith |
std::greater
|
| gptkbp:compatibleWith |
iteration
removalOfArbitraryElement |
| gptkbp:containerAdapterFor |
max-heap
|
| gptkbp:defaultComparison |
std::less
|
| gptkbp:defaultUnderlyingContainer |
gptkb:std::vector
|
| gptkbp:definedIn |
<queue> header
|
| gptkbp:elementAccess |
top
|
| gptkbp:introducedIn |
gptkb:C++98
|
| gptkbp:namespace |
std
|
| gptkbp:seeAlso |
gptkb:std::queue
gptkb:std::stack |
| gptkbp:supports |
pop
size top push empty |
| gptkbp:templateParameters |
T, Container, Compare
|
| gptkbp:threadSafe |
not thread-safe
|
| gptkbp:timeComplexity_pop |
O(log n)
|
| gptkbp:timeComplexity_push |
O(log n)
|
| gptkbp:timeComplexity_top |
O(1)
|
| gptkbp:uses |
graph algorithms
priority scheduling event simulation |
| gptkbp:bfsParent |
gptkb:C++_Standard_Library_iterators
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
std::priority queue
|