Skip to content

Glossary: Algorithms Beyond the Basics in Java

PriorityQueue

Also written: priority queue

Java's min-heap: `poll` always returns the smallest item by the chosen ordering. It gives the nearest place in Dijkstra and the soonest-due batch in the project.

Where the book teaches it

Related terms

heap (min-heap)Comparator.comparingIntArrayDeque