min-priority-queue
RU: очередь с минимальным приоритетом
A priority queue that always removes the element with the smallest key first, typically implemented as a binary min-heap. Dijkstra's algorithm uses it, keyed by tentative distance, to always process the cheapest frontier vertex next.