Skip to content

Glossary: Algorithms Beyond the Basics in Rust

Min-heap

Also written: min heap

A heap that hands back its smallest item first. Rust's `BinaryHeap` is a max-heap, so wrapping entries in `Reverse` gives min-heap behavior, as used for interval end times and Dijkstra's distances.

Where the book teaches it

Related terms

BinaryHeapReverse