PriorityQueue
A binary heap: `poll()` returns the smallest element (or by a Comparator).
Easy
new PriorityQueue<>(Comparator.comparingInt(Node::dist)) — Dijkstra in Java.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.