Glossary: Algorithms Beyond the Basics in Go

Min-heap

Also written: heap

A structure that always hands back its smallest item first, in O(log n) per push or pop. Dijkstra's algorithm and the room counter use one.