Skip to content
UPEEC

std::priority_queue

A heap: `top()` is always the largest (or smallest with `std::greater`).

Easy
Comments 0

std::priority_queue<T, std::vector<T>, std::greater<T>> — the min-heap used in Dijkstra.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.