Skip to content

Glossary: Algorithms Beyond the Basics in C++

min-heap

Also written: heap, priority_queue, std::priority_queue

A structure where the smallest item comes out first. In C++ it is a `std::priority_queue` with `std::greater<>`, used for Dijkstra's algorithm, counting rooms and the roast scheduler.

Where the book teaches it

Related terms

Dijkstra's algorithmstd::queue